论文信息 - Descendants in heap ordered trees or a triumph of computer algebra

Descendants in heap ordered trees or a triumph of computer algebra

A heap ordered tree with n nodes (\size n") is a planted plane tree together with a bijection from the nodes to the set f1;:::;ng which is monotonically increasing when going from the root to the leaves. We consider the number of descendants of the node j in a (random) heap ordered tree of size n j. Precise expressions are derived for the probability distribution and all (factorial) moments. AMS Subject Classication. 05A15 (primary) 05C05 (secondary)

Helmut Prodinger

[1] H. Mahmoud,et al. Average-case analysis of multiple Quickselect: An algorithm for finding order statistics , 1996 .

[2] Wen-Chin Chen,et al. On the Average Altitude of Heap-Ordered Trees , 1994, Int. J. Found. Comput. Sci..

[3] Helmut Prodinger,et al. On the Number of Descendants and Ascendants in Random Search Trees , 1998, Electron. J. Comb..

[4] D. Knuth,et al. Mathematics for the Analysis of Algorithms , 1999 .

[5] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science , 1991 .

[6] Helmut Prodinger. Depth and Path Length of Heap Ordered Trees , 1996, Int. J. Found. Comput. Sci..

[7] Marko Petkovšek,et al. A=B : 等式証明とコンピュータ , 1997 .

[8] H. Prodinger. The Level Of Nodes In Heap Ordered Trees , 1996 .

[9] Helmut Prodinger,et al. On monotone functions of tree structures , 1983, Discret. Appl. Math..