A Partial Analysis of Random Height-Balanced Trees

DOI10.1137/0208003zbMath0402.05024OpenAlexW2020809044MaRDI QIDQ4186339

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) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (9)

Balance in AVL trees and space cost of brother trees ⋮ Expected behaviour analysis of AVL trees ⋮ Aspects of insertion in random trees ⋮ Height balance distribution of search trees ⋮ Improved bounds for the expected behaviour of AVL trees ⋮ Search trees and Stirling numbers ⋮ Unnamed Item ⋮ Higher order analysis of random 1–2 brother trees ⋮ Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures

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