CONSTRUCTING RED-BLACK TREE SHAPES

DOI10.1142/S0129054102001497zbMATH Open1067.68056OpenAlexW2030063053MaRDI QIDQ3021990FDOQ3021990

Authors: Andrea Mantler, Helen Cameron 

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

Recommendations

• scientific article; zbMATH DE number 1488846
• Building graphs from colored trees
• Red-black trees with types
• Red-black trees with relative node keys
• Red-black trees in a functional setting
• On constructing 2-3 trees
• A topological tree of shapes
• Constructing trees in bipartite graphs
• Constructing a binary tree from its traversals

zbMATH Keywords

red-black treestree shapesinsertion-reachability

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Red-black trees in a functional setting
• Red-black trees with relative node keys
• Insertion reachability, skinny skeletons, and path length in red-black trees
• A note on the largest number of red nodes in red-black trees
• Red-black trees with types

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3021990)