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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. DEVROYE. A note on the height of binary search trees. Journal of the ACM, 33:489–498, 1986.
L. DEVROYE and B. REED. On the variance of the height of random binary search trees. SIAM J. Computing, 24:1157–1162, december 1995.
L. DEVROYE and J. M. ROBSON. On the generation of random binary search trees. SIAM J. Computing, 24:1141–1156, december 1995.
J. M. ROBSON. The height of binary search trees. Australian Computer Journal, 11:151–153, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Robson, J.M. (1997). On the concentration of the height of binary search trees. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_200
Download citation
DOI: https://doi.org/10.1007/3-540-63165-8_200
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63165-1
Online ISBN: 978-3-540-69194-5
eBook Packages: Springer Book Archive