The Variance of the height of binary search trees

Authors:
Michael Drmota
Affiliations:
Technische Univ. Wien, Vienna, Austria
Venue:
Theoretical Computer Science
Year:
2002

Citing 7
Cited 3

A note on the height of binary search trees

Journal of the ACM (JACM)
Branching processes in the analysis of the heights of trees

Acta Informatica
On the Variance of the Height of Random Binary Search Trees

SIAM Journal on Computing
Constant bounds on the moments of the height of binary search trees

Theoretical Computer Science
On the Concentration of the Height of Binary Search Trees

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
The height of a random binary search tree

Journal of the ACM (JACM)
An analytic approach to the height of binary search trees II

Journal of the ACM (JACM)

An analytic approach to the height of binary search trees II

Journal of the ACM (JACM)
On Robson's convergence and boundedness conjectures concerning the height of binary search trees

Theoretical Computer Science
Extremal Weighted Path Lengths In Random Binary Search Trees

Probability in the Engineering and Informational Sciences

Quantified Score

Hi-index	5.23

Visualization

Abstract

By using analytic tools it is shown that the variance E(HnEHn)2 of the height Hn of binary search trees of size n is bounded.