UPDATING BINARY TREES WITH CONSTANT LINKAGE COST

DOI10.1142/S0129054192000243MaRDI QIDQ4032924zbMATH OpenFDO

Authors Thomas Ottmann, D. Wood

Publication date 16 May 1993

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054192000243

zbMATH Keywords

balanced binary treesstratified treesupdating algorithms

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Parallel algorithms in computer science (68W10)

Recommendations

• How to update a balanced binary tree with a constant number of rotations
• Red-black trees with constant update time
• Deletion without rebalancing in binary search trees
• Fast updating of well-balanced trees
• Deletion without rebalancing in balanced binary trees

Cited in

(7)

• Purely top-down updating algorithms for stratified search trees
• Red-black trees with constant update time
• Maintaining α-balanced trees by partial rebuilding
• scientific article; zbMATH DE number 4205969 (Why is no real title available?)
• Updating approximately complete trees
• How to update a balanced binary tree with a constant number of rotations
• Binary search trees of almost optimal height

This page was built for publication: UPDATING BINARY TREES WITH CONSTANT LINKAGE COST

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