Stratified balanced search trees

DOI10.1007/BF00289574zbMath0493.68063OpenAlexW2027795789MaRDI QIDQ1168743

Mark H. Overmars, Jan van Leeuwen

Publication date: 1983

Published in: Acta Informatica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items

How to update a balanced binary tree with a constant number of rotations, Binary search trees of almost optimal height, Binary search trees with binary comparison cost, Purely top-down updating algorithms for stratified search trees

Cites Work

• Unnamed Item
• Organization and maintenance of large ordered indexes
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Dense multiway trees
• Insertions and deletions in one-sided height-balanced trees
• An optimal method for deletion in one-sided height-balanced trees
• Deletion in one-sided height balanced search trees