A comparative study of 2-3 trees and AVL trees
From MaRDI portal
Publication:3659162
DOI10.1007/BF00996801zbMath0513.68061MaRDI QIDQ3659162
Publication date: 1983
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00996801
insertion algorithm; AVL trees; storage costs; expected cost comparison; query costs; two-three trees
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
68P05: Data structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On random 2-3 trees
- Organization and maintenance of large ordered indexes
- Query costs in HB(1) trees versus 2?3 trees
- Performance of height-balanced trees
- Minimal-Comparison $2,3$-Trees
- Optimizing binary trees grown with a sorting algorithm
- Binary Search Trees of Bounded Balance
- Optimal 2,3-Trees