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.