From a9502851f50af1808e2155eaf0d4fe8079fd109e Mon Sep 17 00:00:00 2001 From: Oleksii Trekhleb Date: Sat, 23 Jun 2018 13:21:07 +0300 Subject: [PATCH] Update READMEs. --- src/data-structures/tree/README.md | 7 +++++-- 1 file changed, 5 insertions(+), 2 deletions(-) diff --git a/src/data-structures/tree/README.md b/src/data-structures/tree/README.md index 13445b7f..42e69cc6 100644 --- a/src/data-structures/tree/README.md +++ b/src/data-structures/tree/README.md @@ -1,7 +1,10 @@ # Tree -* [Binary Search Tree](https://github.com/trekhleb/javascript-algorithms/tree/master/src/data-structures/tree/binary-search-tree) -* [AVL Tree](https://github.com/trekhleb/javascript-algorithms/tree/master/src/data-structures/tree/avl-tree) +* [Binary Search Tree](binary-search-tree) +* [AVL Tree](avl-tree) +* [Red-Black Tree](red-black-tree) +* [Segment Tree](segment-tree) - with min/max/sum range queries examples +* [Fenwick Tree](fenwick-tree) (Binary Indexed Tree) In computer science, a tree is a widely used abstract data type (ADT) — or data structure implementing this ADT—that