The Variance of the height of binary search trees
- 6 January 2002
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 270 (1-2) , 913-919
- https://doi.org/10.1016/s0304-3975(01)00006-8
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Constant bounds on the moments of the height of binary search treesTheoretical Computer Science, 2002
- An analytic approach to the height of binary search treesAlgorithmica, 2001
- On the Variance of the Height of Random Binary Search TreesSIAM Journal on Computing, 1995
- Branching processes in the analysis of the heights of treesActa Informatica, 1987
- A note on the height of binary search treesJournal of the ACM, 1986
- On growing random binary treesJournal of Mathematical Analysis and Applications, 1984