An analytic approach to the height of binary search trees

Algorithmica (New York)

Volumn 29, Issue 1-2, 2001, Pages 89-119

  Drmota, M ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Average case analysis; Binary search tree

Indexed keywords

DIFFERENTIAL EQUATIONS; RANDOM PROCESSES; THEOREM PROVING;

BINARY SEARCH TREES;

DATA STRUCTURES;

EID: 0002494487     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02679615     Document Type: Article

References (11)

1. L. Devroye, A note on the height of binary search trees, J. Assoc. Comput. Mach. 33 (1986), 489-498.
2. L. Devroye, Branching processes in the analysis of the height of trees, Acta Inform. 24 (1987), 277-298.
3. L. Devroye and B. Reed, On the variance of the height of random binary search trees, SIAM J. Comput. 24 (1995), 1157-1162.
4. M. Drmota and M. Soria, Marking in combinatorial constructions: generating functions and limiting distributions, Theoret. Comput. Sci. 144 (1995), 67-99.
5. X. Gourdon, Unpublished manuscript, 1995.
6. P. Jacquet and W. Szpankowski, Asymptotic behaviour of the Lempel-Ziv parsing scheme and digital search trees, Theoret. comput. Sci. 144 (1995), 161-197.
7. H. M. Mahmoud, Evolution of Random Search Trees, Wiley, New York, 1992.
8. L. Moser and M. Wyman, Asymptotic developments of the Stirling numbers of the first kind, J. London Math. Soc. 33 (1958), 133-146.
9. B. Pittel, On growing random binary trees, J. Math. Anal. Appl. 103 (1984), 461-480.
10. J. M. Robson, The height of binary search trees, Austral. Comput. J. 11 (1979), 151-153.
11. J. M. Robson, Personal communication.