Geodesic
Descendants and ascendants in binary trees
Discrete mathematics & theoretical computer science, Tome 1 (1997).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_1997_1_a15,
     author = {Panholzer, Alois and Prodinger, Helmut},
     title = {Descendants and ascendants in binary trees},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {1},
     year = {1997},
     doi = {10.46298/dmtcs.246},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.246/}
}
TY  - JOUR
AU  - Panholzer, Alois
AU  - Prodinger, Helmut
TI  - Descendants and ascendants in binary trees
JO  - Discrete mathematics & theoretical computer science
PY  - 1997
VL  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.246/
DO  - 10.46298/dmtcs.246
LA  - en
ID  - DMTCS_1997_1_a15
ER  - 
%0 Journal Article
%A Panholzer, Alois
%A Prodinger, Helmut
%T Descendants and ascendants in binary trees
%J Discrete mathematics & theoretical computer science
%D 1997
%V 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.246/
%R 10.46298/dmtcs.246
%G en
%F DMTCS_1997_1_a15
Panholzer, Alois; Prodinger, Helmut. Descendants and ascendants in binary trees. Discrete mathematics & theoretical computer science, Tome 1 (1997). doi : 10.46298/dmtcs.246. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.246/

Cité par Sources :