A note on the height of binary search trees
- 1 May 1986
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 33 (3) , 489-498
- https://doi.org/10.1145/5925.5930
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A probabilistic analysis of the height of tries and of the complexity of triesortActa Informatica, 1984
- On growing random binary treesJournal of Mathematical Analysis and Applications, 1984
- On the Most Probable Shape of a Search Tree Grown from a Random PermutationSIAM Journal on Algebraic Discrete Methods, 1984
- The average height of binary trees and other simple treesJournal of Computer and System Sciences, 1982
- A note on the analysis of extendible hashingInformation Processing Letters, 1980
- Chernoff's theorem in the branching random walkJournal of Applied Probability, 1977
- The first- and last-birth problems for a multitype age-dependent branching processAdvances in Applied Probability, 1976
- Postulates for Subadditive ProcessesThe Annals of Probability, 1974
- On the Distribution of the Number of Vertices in Strata of a Random TreeTheory of Probability and Its Applications, 1969
- On the height of treesJournal of the Australian Mathematical Society, 1967