The Variance of the height of binary search trees

Theoretical Computer Science

Volumn 270, Issue 1-2, 2002, Pages 913-919

  Drmota, Michael ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Average case analysis; Binary search tree; Generating functions

Indexed keywords

BINARY SEQUENCES; DIFFERENTIAL EQUATIONS; POLYNOMIALS; THEOREM PROVING; VARIATIONAL TECHNIQUES;

BINARY SEARCH TREES;

TREES (MATHEMATICS);

EID: 0037028430     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00006-8     Document Type: Article

References (11)

1. A note on the height of binary search trees
2. Branching processes in the analysis of the height of trees
3. On the variance of the height of random binary search trees
4. An analytic approach to the height of binary search trees
5. An analytic approach to the height of binary search trees. II
6. On growing random binary trees
7. The height of a random binary search tree
8. The height of binary search trees
9. On the concentration of the height of binary search trees
10. Constant bounds on the moments of the height of binary search trees