|
1 | 1 | # Tree |
2 | 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) |
| 3 | +* [Binary Search Tree](binary-search-tree) |
| 4 | +* [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) |
5 | 8 |
|
6 | 9 | In computer science, a tree is a widely used abstract data |
7 | 10 | type (ADT) — or data structure implementing this ADT—that |
|
0 commit comments