On the Most Probable Shape of a Search Tree Grown from a Random Permutation
- 1 March 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 5 (1), 69-81
- https://doi.org/10.1137/0605010
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On growing random binary treesJournal of Mathematical Analysis and Applications, 1984
- The average height of binary trees and other simple treesJournal of Computer and System Sciences, 1982
- Limiting Behavior of a Process of RunsThe Annals of Probability, 1981
- On the Average Shape of Binary TreesSIAM Journal on Algebraic Discrete Methods, 1980
- Advanced CombinatoricsPublished by Springer Nature ,1974
- Subadditive Ergodic TheoryThe Annals of Probability, 1973
- THE AVERAGE HEIGHT OF PLANTED PLANE TREESPublished by Elsevier ,1972
- 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
- More Combinatorial Properties of Certain TreesThe Computer Journal, 1965