Higher order analysis of random 1–2 brother trees

DOI10.1007/BF01932772zbMath0442.68066OpenAlexW2088568404MaRDI QIDQ3885212

Wolffried Stucky, Thomas Ottmann

Publication date: 1980

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01932772

zbMATH Keywords

insertion schemerandom 1-2 brother trees

Mathematics Subject Classification ID

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

Related Items (1)

Higher order analysis of random 1–2 brother trees

Cites Work

• On random 2-3 trees
• Comparing insertion schemes used to update 3-2 trees
• 1-2 Brother Trees or AVL Trees Revisited
• Higher order analysis of random 1–2 brother trees
• Dense multiway trees
• A Partial Analysis of Height-Balanced Trees under Random Insertions and Deletions
• A Partial Analysis of Random Height-Balanced Trees
• 2–3 brother trees

This page was built for publication: Higher order analysis of random 1–2 brother trees