On Random Binary Trees

DOI10.1287/moor.9.1.43zbMath0529.68035OpenAlexW2123024824MaRDI QIDQ3311675

Gerald G. Brown, Bruno O. Shubert

Publication date: 1984

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/da1cc94fdbe819da4dcfb9679a352cad20aca8c6

zbMATH Keywords

random binary treescounting formulaasymptotic distribution of binary trees

Mathematics Subject Classification ID

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

Related Items (9)

Uniform generation of forests of restricted height ⋮ Applications of the theory of records in the study of random trees ⋮ The Distribution of Heights of Binary Trees and Other Simple Trees ⋮ Exact and asymptotic distributions in digital and binary search trees ⋮ Profiles of random trees: correlation and width of random recursive trees and binary search trees ⋮ Weighted height of random trees ⋮ Martingales and large deviations for binary search trees ⋮ On weighted depths in random binary search trees ⋮ Branching random walks on binary search trees: convergence of the occupation measure

This page was built for publication: On Random Binary Trees