A note on the path length of red-black trees

DOI10.1016/0020-0190(92)90038-WzbMath0780.68053MaRDI QIDQ1198079

Helen Cameron, Derick Wood

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

upper boundanalysis of algorithmsdata structuresasymptotic tightnesshalf-balanced binary treeinternal path length of a red-black treesymmetric binary \(B\)-tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (2)

Insertion reachability, skinny skeletons, and path length in red-black trees ⋮ A note on the expected path length of trees with known fringe

Cites Work

• A tight upper bound for the path length of AVL trees
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the path length of red-black trees