Rank-Balanced Trees

DOI10.1145/2689412zbMath1398.68108OpenAlexW1958605991MaRDI QIDQ4962191

Bernhard Haeupler, Siddhartha Sen, Robert Endre 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

data structuresamortized complexitysearch treesred-black treesAVL treesexponential potential functionbalanced binary trees

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (3)

Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines ⋮ ASA-graphs for efficient data representation and processing ⋮ Amortized rotation cost in AVL trees

This page was built for publication: Rank-Balanced Trees