Grandchildren-weight-balanced binary search trees

DOI10.4230/LIPICS.WADS.2025.40MaRDI QIDQ7312591zbMATH OpenFDO

Authors Vincent Jugé

Publication date 11 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.WADS.2025.40

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites work

• A note on the path length of red-black trees
• A tight upper bound for the path length of AVL trees
• A TOP-DOWN UPDATING ALGORITHM FOR WEIGHT-BALANCED TREES
• Amortized rotation cost in AVL trees
• Data structures for range median queries
• Engineering Top-Down Weight-Balanced Trees
• scientific article; zbMATH DE number 3551889 (Why is no real title available?)
• scientific article; zbMATH DE number 1830753 (Why is no real title available?)
• On the average number of rebalancing operations in weight-balanced trees
• Organization and maintenance of large ordered indexes
• Rank-Balanced Trees
• Self-adjusting binary search trees
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
• Upper Bounds for the Total Path Length of Binary Trees

This page was built for publication: Grandchildren-weight-balanced binary search trees

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