Analysis of the space of search trees under the random insertion algorithm
- 31 March 1989
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 10 (1), 52-75
- https://doi.org/10.1016/0196-6774(89)90023-0
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the joint distribution of the insertion path length and the number of comparisons in search treesDiscrete Applied Mathematics, 1988
- Some average measures in m-ary search treesInformation Processing Letters, 1987
- On the average internal path length of m-ary search treesActa Informatica, 1986
- The analysis of a fringe heuristic for binary search treesJournal of Algorithms, 1985
- On the Most Probable Shape of a Search Tree Grown from a Random PermutationSIAM Journal on Algebraic Discrete Methods, 1984
- On random 2?3 treesActa Informatica, 1978