Randomness Preserving Deletions on Special Binary Search Trees

DOI10.1016/j.entcs.2008.12.069zbMath1336.68129OpenAlexW1966719344MaRDI QIDQ4982056

Michaela Heyer

Publication date: 23 March 2015

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.069

zbMATH Keywords

binary search treesrandomness preservationKnott's paradox

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (1)

Maintaining Ideally Distributed Random Search Trees without Extra Space

Cites Work

• Unnamed Item
• Unnamed Item
• A trivial algorithm whose analysis isn't
• Attribute grammars and automatic complexity analysis
• Randomized search trees
• Randomized binary search trees
• Deletions That Preserve Randomness
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting

This page was built for publication: Randomness Preserving Deletions on Special Binary Search Trees