8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 42c7a15 commit a950285Copy full SHA for a950285
src/data-structures/tree/README.md
@@ -1,7 +1,10 @@
1
# Tree
2
3
-* [Binary Search Tree](https://github.com/trekhleb/javascript-algorithms/tree/master/src/data-structures/tree/binary-search-tree)
4
-* [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)
5
+* [Red-Black Tree](red-black-tree)
6
+* [Segment Tree](segment-tree) - with min/max/sum range queries examples
7
+* [Fenwick Tree](fenwick-tree) (Binary Indexed Tree)
8
9
In computer science, a tree is a widely used abstract data
10
type (ADT) — or data structure implementing this ADT—that
0 commit comments