Advertisement

On the concentration of the height of binary search trees

  • J. M. Robson
Session 11: Analysis of Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1256)

Abstract

The expectation of the absolute value of the difference between the heights of two random binary search trees of n nodes is less than 6.25 for infinitely many n. Given a plausible assumption, this expectation is less than 4.96 for all but a finite number of values of n.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • J. M. Robson
    • 1
  1. 1.LaBRIUniversité Bordeaux 1France

Personalised recommendations