Left and right length of paths in binary trees or on a question of Knuth - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2006

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

Résumé

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.
Fichier principal
Vignette du fichier
dmAG0136.pdf (148.14 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01184699 , version 1 (17-08-2015)

Identifiants

Citer

Alois Panholzer. Left and right length of paths in binary trees or on a question of Knuth. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.415-418, ⟨10.46298/dmtcs.3495⟩. ⟨hal-01184699⟩

Collections

TDS-MACS
65 Consultations
514 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More