The height of a random binary search tree

Journal of the ACM

Volumn 50, Issue 3, 2003, Pages 306-332

  Reed, Bruce ^a,b  

^a MCGILL UNIVERSITY   (Canada)

^b CNRS   (France)

Author keywords

Asymptotics; Binary search tree; Height; Probabilistic analysis; Random tree; Second moment method

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; FINITE DIFFERENCE METHOD; PROBABILITY; STATISTICAL METHODS; TREES (MATHEMATICS);

BINARY SEARCH TREE; PROBABILISTIC ANALYSIS; RANDOM TREES; SECOND MOMENT METHOD;

RANDOM PROCESSES;

EID: 1542456902     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/765568.765571     Document Type: Article

References (18)

1. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1975. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.
2. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1983. Data Structures and Algorithms, Addison-Wesley, Reading, Mass.
3. CHERNOFF, H. 1952. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 493-507.
4. DEVROYE, L. 1986. A note on the height of binary search trees. J. ACM 33, 489-498.
5. DEVROYE, L. 1987. Branching processes in the analysis of the heights of trees. Acta Inf. 24, 277-298.
6. DEVROYE, L. 1990. On the height of random m-ary search trees. Rand. Struct. Algorithms 1, 191-203.
7. DEVROYE, L., AND REED, B. 1995. On the variance of the height of random binary search trees. SIAM J. Comput. 24, 1107-1112.
8. DRMOTA, M. 2003. An analytic approach to the height of binary search trees II. J. ACM 50, 3 (May), 333-374.
9. KNUTH, D. E. 1973a. The Art of Computer Programming, Vol. 1: Fundamental Algorithms. Addison-Wesley, Reading, Mass., 2nd ed.
10. KNUTH,D.E. 1973b. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Mass.
11. MAHMOUD, H. M. 1992. Evolution of Random Search Trees. John Wiley, New York.
12. MAHMOUD, H., AND PITTEL, B. 1994. On the most probable shape of a search tree grown from a random permutation. SIAM J. Algeb. Disc. Meth. 5, 69-81.
13. PITTEL, B. 1984 On growing random binary trees. J. Math. Anal. Appl. 103, 461-480.
14. PITTEL, B. 1994. Note on the heights of random recursive trees and random m-ary search trees. Rand. Struct. Algorithms 5, 337-347.
15. PYKE, R. 1965. Spacings. J. Roy. Stat. Soc., Ser., B 7, 395-445.
16. ROBSON, J. M. 1979. The height of binary search trees. Austral. Comput. J. 11, 151-153.
17. ROBSON, J. M. 1982. The asymptotic behaviour of the height of binary search trees. Austral. Comput. Sci. Commun. p. 88.
18. SHORACK, G., AND WELLNER, J. 1986. Empirical Processes with Applications to Statistics. Wiley, New York.