The asymptotic distribution of leaf heights in binary trees
From MaRDI portal
Publication:1199121
DOI10.1007/BF02349961zbMath0772.05034WikidataQ59255191 ScholiaQ59255191MaRDI QIDQ1199121
Georg Ch. Pflug, Walter J. Gutjahr
Publication date: 16 January 1993
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Asymptotic distribution theory in statistics (62E20) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)
Related Items (4)
Moments of level numbers of leaves in binary trees ⋮ The limiting common distribution of two leaf heights in a random binary tree ⋮ The shape of random pattern-avoiding permutations ⋮ The asymptotic contour process of a binary tree is a Brownian excursion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The average height of binary trees and other simple trees
- The asymptotic contour process of a binary tree is a Brownian excursion
- On the average oscillation of a stack
- On Level Numbers of t-Ary Trees
- A note on the stack size of regularly distributed binary trees
- On the Average Shape of Binary Trees
- The limiting common distribution of two leaf heights in a random binary tree
- The Variance of Level Numbers in Certain Families of Trees
This page was built for publication: The asymptotic distribution of leaf heights in binary trees