Rank-Balanced Trees

DOI10.1007/978-3-642-03367-4_31MaRDI QIDQ3183467zbMATH OpenOpenAlexFDO

Authors Bernhard Haeupler, Siddhartha Sen, Robert E. 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

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

Recommendations

• Rank-Balanced Trees
• Deletion without rebalancing in binary search trees
• Deletion without rebalancing in balanced binary trees
• Publication:3702498
• Balancing binary trees by internal path reduction

Cites work

• scientific article; zbMATH DE number 3770965 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1064419 (Why is no real title available?)
• Amortized Computational Complexity
• Binary Search Trees of Bounded Balance
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Updating a balanced search tree in 0(1) rotations

Cited in

(13)

• Priority Range Trees
• Deletion without rebalancing in balanced binary trees
• Deletion without rebalancing in binary search trees
• Skip lift: a probabilistic alternative to red-black trees
• The modification of the Sedgewick's balancing algorithm
• Deletion without rebalancing in multiway search trees
• scientific article; zbMATH DE number 7051217 (Why is no real title available?)
• Skip lift: a probabilistic alternative to red-black trees
• scientific article; zbMATH DE number 3928331 (Why is no real title available?)
• Rank-Balanced Trees
• A note on the path length of red-black trees
• Balanced ordered trees
• Verified Root-Balanced Trees

Describes a project that uses

Uses Software

• Stony Brook

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 Q3183467)