Abstract
Assume that the leaves of a planted plane tree are enumerated from left to right by 1, 2, .... Thej-ths-turn of the tree is defined to be the root of the (unique) subtree of minimal height with leavesj, j+1, ...,j+s−1. If all trees withn nodes are regarded equally likely, the average level number of thej-ths-turn tends to a finite limitα s (j), which is of orderj 1/2. Thej-th ”s-hyperoscillation”α 1(j)−α s+1(j) is given by 1/2α 1(s)+O(j −1/2) and therefore tends (forj → ∞) to a constant behaving like √8/π·s 1/2 fors → ∞. These results are obtained by setting up appropriate generating functions, which are expanded about their (algebraic) singularities nearest to the origin, so that the asymptotic formulas are consequences of the so-called Darboux-Pólyamethod.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. G. de Bruijn, D. E. Knuth andS. O. Rice, The average height of planted plane trees, in:Graph theory and computing (R. C. Read, ed.) Academic Press, New York-London, (1972), 15–22.
L. Comtet,Advanced Combinatorics, Cloth Edition, D. Reidel, Dordrecht, (1974).
Ph. Flajolet,Analyse d’algorithmes de manipulation d’arbres et de fichiers, Thése Paris-Sud-Orsay, (1979).
Ph. Flajolet andA. Odlyzko, Exploring binary trees and other simple trees, In:Proc. of the 21 st Annual Symposium on Foundations of Computer Science, Syracuse, (1980), 207–216.
Ph. Flajolet andA. Odlyzko, The average height of binary trees and other simple trees,INRIA Rapports de Recherche 56 (1981); also:J. Comput. System Sci., to appear.
Ph. Flajolet andJ. M. Steyaert, On the analysis of tree matching algorithms, In: 7th ICALP Conf. Amsterdam, (1980).
F. Harary andE. M. Palmer,Graphical Enumeration, Academic Press, New York-London, (1973).
R. Kemp, On the average stack size of regularly distributed binary trees, In:6 th ICALP Conf. Graz, (1979), 340–355.
R. Kemp, A note on the stack size of regularly distributed binary trees.BIT 20, (1980), 157–163.
R. Kemp, The average height ofr-tuply rooted planted plane trees.Computing 25, (1980), 209–232.
R. Kemp, On the average oscillation of a stack, Combinatorica,2 (2) (1982) 157–176.
R. Kemp, The average height of planted plane trees with m leaves,preprint, (1981).
P. Kirschenhofer, On the average shape of monotonically labelled tree structures,preprint, TU Wien, Austria, (1981).
P. Kirschenhofer andH. Prodinger, On the average height of monotonically labelled binary trees, presented at:6 th Hungarian Colloquium on Combinatorics, Eger, (1981).
A. Meir andJ. W. Moon, On the altitude of nodes in random trees,Canad. J. of Math.,30, (1978), 997–1015.
A. Odlyzko, Periodic oscillations of coefficients of power series that satisfy functional equations,to appear, (1979).
H. Prodinger, The average height of a stack where three operations are allowed and some related problems,J. Comb. Inf. Syst. Sci. 5, (1980), 287–304.
H. Prodinger, A note on a result of R. Kemp onr-tuply rooted planted plane trees,Computing,28, (1982), 363–366.
H. Prodinger andF. J. Urbanek, On monotone functions of tree structures,Discr. Appl. Math., to appear, (1981).
F. Ruskey, On the average shape of binary trees,SIAM J. Alg. Disc. Meth. 1, (1980), 43–50.