Skip to Main content Skip to Navigation
Journal articles

Descendants and ascendants in binary trees

Abstract : There are three classical algorithms to visit all the nodes of a binary tree - preorder, inorder and postorder traversal. From this one gets a natural labelling of the n internal nodes of a binary tree by the numbers 1, 2, ..., n, indicating the sequence in which the nodes are visited. For given n (size of the tree) and j (a number between 1 and n), we consider the statistics number of ascendants of node j and number of descendants of node j. By appropriate trivariate generating functions, we are able to find explicit formulae for the expectation and the variance in all instances. The heavy computations that are necessary are facilitated by MAPLE and Zeilberger's algorithm. A similar problem comes fromlabelling the leaves from left to right by 1, 2, ..., n and considering the statistic number of ascendants (=height) of leaf j. For this, Kirschenhofer [1] has computed the average. With our approach, we are also able to get the variance. In the last section, a table with asymptotic equivalents is provided for the reader's convenience.
Document type :
Journal articles
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-00955702
Contributor : Alain Monteil <>
Submitted on : Wednesday, March 5, 2014 - 9:31:56 AM
Last modification on : Wednesday, November 29, 2017 - 10:26:25 AM
Long-term archiving on: : Thursday, June 5, 2014 - 10:55:58 AM

File

dm010116.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00955702, version 1

Collections

Citation

Alois Panholzer, Helmut Prodinger. Descendants and ascendants in binary trees. Discrete Mathematics and Theoretical Computer Science, DMTCS, 1997, 1, pp.247-266. ⟨hal-00955702⟩

Share

Metrics

Record views

776

Files downloads

2033