Some Average Measures in m-ary Search Trees
暂无分享,去创建一个
Abstract We obtain the expected number of comparisons for an unsuccessful search and the average storage performance of the m-ary search tree under three different storage methods. We model the trees as being built from uniform, random keys.
[1] Kurt Mehlhorn,et al. The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees , 1982, Inf. Control..
[2] J. Ian Munro,et al. The Analysis of a Fringe Heuristic for Binary Search Trees , 1985, J. Algorithms.
[3] Achim Clausing. Kantorovich-Type Inequalities , 1982 .