Analysis of the standard deletion algorithms in exact fit domain binary search trees
From MaRDI portal
Publication:911249
DOI10.1007/BF01840390zbMath0696.68031MaRDI QIDQ911249
J. Ian Munro, Joseph C. Culberson
Publication date: 1990
Published in: Algorithmica (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68P05: Data structures
Related Items
Optimal binary search trees, Deletions in random binary search trees: a story of errors, Average search and update costs in skip lists, Emerging behavior as binary search trees are symmetrically updated.
Cites Work
- A trivial algorithm whose analysis is not: a continuation
- A trivial algorithm whose analysis isn't
- Trees, Forests and Rearranging
- On the efficiency of a new method of dictionary construction
- Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item