On Random Binary Trees

DOI10.1287/MOOR.9.1.43MaRDI QIDQ3311675zbMATH OpenOpenAlexFDO

Authors 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

asymptotic distribution of binary treescounting formularandom binary trees

Mathematics Subject Classification ID

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

Cited in

(11)

• Applications of the theory of records in the study of random trees
• Uniform generation of forests of restricted height
• On weighted depths in random binary search trees
• Martingales and large deviations for binary search trees
• Branching random walks on binary search trees: convergence of the occupation measure
• Exact and asymptotic distributions in digital and binary search trees
• The Distribution of Heights of Binary Trees and Other Simple Trees
• Profiles of random trees: correlation and width of random recursive trees and binary search trees
• Surrogate selection oversamples expanded T cell clonotypes
• Random multi-hooking networks
• Weighted height of random trees

This page was built for publication: On Random Binary Trees

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