Some average measures in m-ary search trees
- 26 July 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 25 (6) , 375-381
- https://doi.org/10.1016/0020-0190(87)90215-8
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- 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
- The theory of fringe analysis and its application to 23 trees and b-treesInformation and Control, 1982
- Kantorovich-Type InequalitiesThe American Mathematical Monthly, 1982
- On random 2?3 treesActa Informatica, 1978