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.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 1997, 1, pp.247-266
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger
Contributeur : Alain Monteil <>
Soumis le : mercredi 5 mars 2014 - 09:31:56
Dernière modification le : mercredi 29 novembre 2017 - 10:26:25
Document(s) archivé(s) le : jeudi 5 juin 2014 - 10:55:58


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00955702, version 1



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



Consultations de la notice


Téléchargements de fichiers