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.
Cite
CITATION STYLE
APA
Robson, J. M. (1997). On the concentration of the height of binary search trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1256, pp. 441–448). Springer Verlag. https://doi.org/10.1007/3-540-63165-8_200
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free