On the concentration of the height of binary search trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 441-448

  Robson, J M ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORESTRY;

ABSOLUTE VALUES; BINARY SEARCH TREES; FINITE NUMBER; PLAUSIBLE ASSUMPTIONS; RANDOM BINARY SEARCH TREE;

BINARY TREES;

EID: 84951018227     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_200     Document Type: Conference Paper

References (4)

1. L. DEVROYE. A note on the height of binary search trees. Journal of the ACM, 33:489-498, 1986.
2. L. DEVROYE and B. REED. On the variance of the height of random binary search trees. SI AM J. Computing, 24:1157-1162, december 1995.
3. L. DEVROYE and J. M. ROBSON. On the generation of random binary search trees. SIAM J. Computing, 24:1141-1156, december 1995.
4. J. M. ROBSON. The height of binary search trees. Australian Computer Journal, 11:151-153, 1979.