Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. A note on the height of binary search trees;Devroye;J. Assoc. Comput. Mach.,1986
2. Branching processes in the analysis of the height of trees;Devroye;Acta Inform.,1987
3. On the variance of the height of random binary search trees;Devroye;SIAM J. Comput.,1995
4. An analytic approach to the height of binary search trees;Drmota;Algorithmica,2001
5. M. Drmota, An analytic approach to the height of binary search trees. II, J. Assoc. Comput. Mach., submitted for publication.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Arbres binaires de recherche;Arbres pour l’Algorithmique;2018
2. RETRACTED ARTICLE: Strong limiting behavior in binary search trees;Journal of Inequalities and Applications;2013-02-20
3. Limiting theorems for the nodes in binary search trees;Science in China Series A: Mathematics;2008-01
4. EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES;Probability in the Engineering and Informational Sciences;2006-12-15
5. The climbing depth of random trees;Random Structures and Algorithms;2005-01