Left and right length of paths in binary trees or on a question of Knuth

DOI10.1007/S00026-009-0005-1zbMath1229.05087OpenAlexW1981230263MaRDI QIDQ659771

Alois Panholzer

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-009-0005-1

zbMATH Keywords

imbalancebinary treesnode depth

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Left and right pathlengths in random binary trees
• Moments of level numbers of leaves in binary trees
• The center of mass of the ISE and the Wiener index of trees
• Limit laws for embedded trees: Applications to the integrated superBrownian excursion
• Singularity Analysis of Generating Functions
• The Wiener Index of simply generated random trees
• The rotation correspondence is asymptotically a dilatation

This page was built for publication: Left and right length of paths in binary trees or on a question of Knuth