Improved bounds for the expected behaviour of AVL trees
From MaRDI portal
Publication:1196459
DOI10.1007/BF01994883zbMath0761.68029OpenAlexW2073154951MaRDI QIDQ1196459
Nivio Ziviani, Ricardo A. Baeza-Yates, Gaston H. Gonnet
Publication date: 14 December 1992
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01994883
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Data structures (68P05)
Cites Work
- On random 2-3 trees
- An Amortized Analysis of Insertions into AVL-Trees
- 1-2 Brother Trees or AVL Trees Revisited
- A Partial Analysis of Height-Balanced Trees under Random Insertions and Deletions
- A Look at Symmetric Binary B-Trees
- A Partial Analysis of Random Height-Balanced Trees
- The theory of fringe analysis and its application to 23 trees and b-trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item