A Partial Analysis of Random Height-Balanced Trees

DOI10.1137/0208003MaRDI QIDQ4186339zbMATH OpenOpenAlexFDO

Authors Mark R. Brown

Publication date 1979

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0208003

zbMATH Keywords

Fringe NodeHeight-Balanced Binary TreesNumber of Balanced NodesRandom Height-Balanced Binary Tree

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(9)

• Aspects of insertion in random trees
• Height balance distribution of search trees
• Improved bounds for the expected behaviour of AVL trees
• Balance in AVL trees and space cost of brother trees
• Search trees and Stirling numbers
• Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
• scientific article; zbMATH DE number 3928331 (Why is no real title available?)
• Higher order analysis of random 1–2 brother trees
• Expected behaviour analysis of AVL trees

This page was built for publication: A Partial Analysis of Random Height-Balanced Trees

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