An analytic approach to the height of binary search trees
- 1 February 2001
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 29 (1) , 89-119
- https://doi.org/10.1007/bf02679615
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the Variance of the Height of Random Binary Search TreesSIAM Journal on Computing, 1995
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search treesTheoretical Computer Science, 1995
- Marking in combinatorial constructions: Generating functions and limiting distributionsTheoretical Computer Science, 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
- Asymptotic Development of the Stirling Numbers of the First KindJournal of the London Mathematical Society, 1958