Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Left and right lengt ...
Conference paper

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

Alois Panholzer (1)
(1) Institut für Diskrete Mathematik und Geometrie [Wien]
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2005
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
Proceedings
DOI
10.46298/dmtcs.3495
License
https://about.hal.science/hal-authorisation-v1
Indicators
509
Views
462
Downloads

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

Alois Panholzer (1)
(1) Institut für Diskrete Mathematik und Geometrie [Wien]
Abstract
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.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC]
  • binary trees
  • imbalance
  • node depth
Cited by

Source: OpenCitations

  • Cutting down $\mathbf{p}$-trees and inhomogeneous continuum random trees

    Bernoulli

    Authors : Nicolas Broutin, Minmin Wang ORCID

    Journal reference : Volume 23, 2017, pp.

    DOI : 10.3150/16-bej813
  • On q -functional equations and excursion moments

    Discrete Mathematics

    Authors : Christoph Richard ORCID

    Journal reference : Volume 309, 2008, pp. 207-230

    DOI : 10.1016/j.disc.2007.12.072
Preview
Loading PDF preview...