Analysis of the standard deletion algorithms in exact fit domain binary search trees
From MaRDI portal
Publication:911249
DOI10.1007/BF01840390zbMath0696.68031OpenAlexW2080437655MaRDI QIDQ911249
J. Ian Munro, Joseph C. Culberson
Publication date: 1990
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01840390
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items (5)
Analysis of the expected search cost in skip lists ⋮ Emerging behavior as binary search trees are symmetrically updated. ⋮ Average search and update costs in skip lists ⋮ Deletions in random binary search trees: a story of errors ⋮ Optimal binary search trees
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
This page was built for publication: Analysis of the standard deletion algorithms in exact fit domain binary search trees
