On the total heights of random rooted binary trees

DOI10.1006/jctb.1994.1041zbMath0809.05085OpenAlexW2025804280MaRDI QIDQ1333336

Lajos Takács

Publication date: 13 September 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1994.1041

zbMATH Keywords

random treesheight of a vertexrooted binary tree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Related Items (4)

Cost functionals for large (uniform and simply generated) random trees ⋮ Tail asymptotics for the area under the excursion of a random walk with heavy-tailed increments ⋮ The sum of powers of subtree sizes for conditioned Galton-Watson trees ⋮ Local asymptotics for the area of random walk excursions

This page was built for publication: On the total heights of random rooted binary trees