Alois Panholzer

Left and right length of paths in binary trees or on a question of Knuth
dmtcs:3495 
Discrete Mathematics & Theoretical Computer Science,
January 1, 2006,
DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities

https://doi.org/10.46298/dmtcs.3495
Left and right length of paths in binary trees or on a question of Knuth
Authors: Alois Panholzer ^{1}
NULL
Alois Panholzer
1 Institut für Diskrete Mathematik und Geometrie [Wien]
We consider extended binary trees and study the common right and left depth of leaf $j$, where the leaves are labelled from left to right by $0, 1, \ldots, n$, and the common right and left external pathlength of binary trees of size $n$. Under the random tree model, i.e., the Catalan model, we characterize the common limiting distribution of the suitably scaled left depth and the difference between the right and the left depth of leaf $j$ in a random size$n$ binary tree when $j \sim \rho n$ with $0< \rho < 1$, as well as the common limiting distribution of the suitably scaled left external pathlength and the difference between the right and the left external pathlength of a random size$n$ binary tree.