Rank-Balanced Trees

DOI10.1145/2689412MaRDI QIDQ4962191zbMATH OpenOpenAlexFDO

Authors Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan

Publication date 30 October 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2689412

zbMATH Keywords

amortized complexityAVL treesbalanced binary treesdata structuresexponential potential functionred-black treessearch trees

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Rank-Balanced Trees
• Balanced ordered trees
• General Balanced Trees
• Multidimensional balanced binary trees
• Balanced spanning forests and trees
• Balanced integral trees
• scientific article; zbMATH DE number 4041938
• scientific article; zbMATH DE number 568846
• Balanced binary trees in the Tamari lattice

Cited in

(13)

• ASA-graphs for efficient data representation and processing
• Priority Range Trees
• Deletion without rebalancing in non-blocking binary search trees
• Rank-Balanced Trees
• scientific article; zbMATH DE number 3928331 (Why is no real title available?)
• An Amortized Analysis of Insertions into AVL-Trees
• Balanced ordered trees
• scientific article; zbMATH DE number 7051217 (Why is no real title available?)
• Amortized rotation cost in AVL trees
• Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines
• Succinct encodings of binary trees with application to AVL trees
• Grandchildren-weight-balanced binary search trees
• Efficient top-down updates in AVL trees

This page was built for publication: Rank-Balanced Trees

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