On the average internal path length of m-ary search trees
- 1 April 1986
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 23 (1), 111-117
- https://doi.org/10.1007/bf00268078
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On the Most Probable Shape of a Search Tree Grown from a Random PermutationSIAM Journal on Algebraic Discrete Methods, 1984
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Asymptotic Methods in EnumerationSIAM Review, 1974
- Some Combinatorial Properties of Certain Trees With Applications to Searching and SortingJournal of the ACM, 1962