Self-Balancing Search Tree
- is a type of search tree that automatically keeps its height small in the face of arbitrary item insertions and deletions
Data Structures Implementing This Type of Tree
- AVL tree - is a self-balancing Binary Search Tree (BST)
- B-Tree B+Tree B*Tree - is a self-balancing M-Way Search Tree (MST)
- Red-Black Tree
- R-Tree
- 2–3 tree
- AA tree
- Scapegoat tree
- Splay tree
- Treap
- Weight-balanced tree