A trivial algorithm whose analysis is not: a continuation

DOI10.1007/BF02219226zbMath0677.68034OpenAlexW1963687747MaRDI QIDQ1123606

Ricardo A. Baeza-Yates

Publication date: 1989

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02219226

zbMATH Keywords

binary search treesdeletion algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10)

Related Items (3)

Emerging behavior as binary search trees are symmetrically updated. ⋮ Analysis of the standard deletion algorithms in exact fit domain binary search trees ⋮ Deletions in random binary search trees: a story of errors

Cites Work

• Unnamed Item
• A trivial algorithm whose analysis isn't
• A Partial Analysis of Height-Balanced Trees under Random Insertions and Deletions
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting

This page was built for publication: A trivial algorithm whose analysis is not: a continuation