Maintaining Ideally Distributed Random Search Trees without Extra Space

DOI10.1007/978-3-642-03456-5_9zbMath1258.68043OpenAlexW1550426043MaRDI QIDQ3644719

Raimund Seidel

Publication date: 12 November 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03456-5_9

zbMATH Keywords

binary search treesrandomized data structures

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• A trivial algorithm whose analysis isn't
• Randomized search trees
• Randomized binary search trees
• A Partial Analysis of Height-Balanced Trees under Random Insertions and Deletions
• Deletions That Preserve Randomness
• Randomness Preserving Deletions on Special Binary Search Trees

This page was built for publication: Maintaining Ideally Distributed Random Search Trees without Extra Space