Optimal Multiway Split Trees

Abstract A class of multiway split trees is defined. Given a set of n weighted keys and a node capacity m , an algorithm is described for constructing a multiway split tree with minimum access cost. The algorithm runs in time O ( mn 4 ) and requires O ( mn 3 ) storage locations. A further refinement of the algorithm enables the factor m in the above costs to be reduced to log m .