Maintaining Ideally Distributed Random Search Trees without Extra Space

DOI10.1007/978-3-642-03456-5_9MaRDI QIDQ3644719zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Randomized binary search trees
• Randomization of search trees by subtree size
• Randomized search trees
• Randomness Preserving Deletions on Special Binary Search Trees
• Analysis of the standard deletion algorithms in exact fit domain binary search trees

Cites work

• scientific article; zbMATH DE number 3887061 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• A Partial Analysis of Height-Balanced Trees under Random Insertions and Deletions
• A trivial algorithm whose analysis isn't
• Deletions That Preserve Randomness
• Randomized binary search trees
• Randomized search trees
• Randomness Preserving Deletions on Special Binary Search Trees

Cited in

(4)

• Random binary search tree with equal elements
• Randomized binary search trees
• Bottom-up rebalancing binary search trees by flipping a coin
• Randomization of search trees by subtree size

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644719)