Stratified balanced search trees

DOI10.1007/BF00289574MaRDI QIDQ1168743zbMATH OpenOpenAlexFDO

Authors Mark H. Overmars, J. 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)

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• An optimal method for deletion in one-sided height-balanced trees
• Deletion in one-sided height balanced search trees
• Dense multiway trees
• Insertions and deletions in one-sided height-balanced trees
• Organization and maintenance of large ordered indexes
• Symmetric binary B-trees: Data structure and maintenance algorithms

Cited in

(4)

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

This page was built for publication: Stratified balanced search trees

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