Descendants and ascendants in binary trees - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 1997

Descendants and ascendants in binary trees

Résumé

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.
Fichier principal
Vignette du fichier
dm010116.pdf (235.95 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00955702 , version 1 (05-03-2014)

Identifiants

Citer

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

Collections

TDS-MACS
692 Consultations
3548 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More