Constant bounds on the moments of the height of binary search trees
- 6 April 2002
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 276 (1-2) , 435-444
- https://doi.org/10.1016/s0304-3975(01)00306-1
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- On the Variance of the Height of Random Binary Search TreesSIAM Journal on Computing, 1995
- On the Generation of Random Binary Search TreesSIAM Journal on Computing, 1995
- A note on the height of binary search treesJournal of the ACM, 1986