CONSTRUCTING RED-BLACK TREE SHAPES

DOI10.1142/S0129054102001497zbMath1067.68056OpenAlexW2030063053MaRDI QIDQ3021990

Helen Cameron, Andrea Mantler

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054102001497

zbMATH Keywords

red-black treestree shapesinsertion-reachability

Mathematics Subject Classification ID

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

Related Items (1)

A note on the largest number of red nodes in red-black trees

Cites Work

• Insertion reachability, skinny skeletons, and path length in red-black trees
• Dense multiway trees
• A comparison of iterative and defined classes of search trees

This page was built for publication: CONSTRUCTING RED-BLACK TREE SHAPES