Abstract
AbstractWe extend results about heights of random trees (Devroye, JACM 33 (1986) 489–498, SIAM J COMP 28 (1998) 409–432). In this paper, a general split tree model is considered in which the normalized subtree sizes of nodes converge in distribution. The height of these trees is shown to be in probability asymptotic to clog n for some constant c. We apply our results to obtain a law of large numbers for the height of all polynomial varieties of increasing trees (Bergeron et al. Lect Notes Comput Sci (1992) 24–48).© 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
