Insertion reachability, skinny skeletons, and path length in red-black trees

DOI10.1016/0020-0255(94)90052-3zbMath0813.68140OpenAlexW1966182812MaRDI QIDQ1328538

Derick Wood, Helen Cameron

Publication date: 26 July 1994

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(94)90052-3

zbMATH Keywords

binary treesred-black trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

CONSTRUCTING RED-BLACK TREE SHAPES

Cites Work

• Unnamed Item
• A tight upper bound for the path length of AVL trees
• A note on the path length of red-black trees
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Dense multiway trees
• A comparison of iterative and defined classes of search trees

This page was built for publication: Insertion reachability, skinny skeletons, and path length in red-black trees