Ordered dictionaries and balanced search trees
14 methods in the atlas attack this one problem. They are rivals: each wins something the others do not.
Phrasings that mean this problem
Ordered dictionaryBalanced dictionaryStrictly balanced dictionarySelf-adjusting dictionaryRandomized balanced dictionaryRotation-free balanced dictionarySimplified balanced dictionaryMultiway balanced dictionaryProbabilistic ordered dictionaryCompetitive-optimal BST theory
search-structures
- Binary search treestandalonecanonsearch-structures
- AVL treeHeight-balance rotationscanonsearch-structures
- Red-black treeColor-invariant rebalancingcanonsearch-structures
- Weight-balanced treeSubtree-size ratio rotationsstandardsearch-structures
- WAVL treeRank-rule rebalancingspecialistsearch-structures
- Splay treeMove-to-root splayingcanonsearch-structures
- TreapRandom heap prioritiescanonfull lesson ▸search-structures
- Zip treeGeometric random ranksspecialistsearch-structures
- Scapegoat treeAlpha-weight-balance rebuildstandardsearch-structures
- AA treeLevel-based skew and splitspecialistsearch-structures
- 2-3 treestandalonestandardsearch-structures
- 2-3-4 treestandalonespecialistsearch-structures
- Skip listCoin-flip level promotioncanonfull lesson ▸search-structures
- Tango treePreferred-path decompositionspecialistsearch-structures