Rank-Balanced Trees

DOI10.1007/978-3-642-03367-4_31zbMath1253.68108OpenAlexW1504640095MaRDI QIDQ3183467

Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan

Publication date: 20 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03367-4_31

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (3)

Deletion without rebalancing in multiway search trees ⋮ Skip lift: a probabilistic alternative to red-black trees ⋮ Skip Lift: A Probabilistic Alternative to Red-Black Trees

Uses Software

• Stony Brook

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Updating a balanced search tree in 0(1) rotations
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Amortized Computational Complexity
• Binary Search Trees of Bounded Balance

This page was built for publication: Rank-Balanced Trees