Optimal Binary Search Tree Research Articles

Optimal Binary Search Trees with Restricted Maximal Depth

An algorithm is given for constructing a binary tree of minimum weighted path length for n nonnegative weights under the constraint that no path length exceed a given bound L. The number of operations required is proportional to $Ln^2 $. Such problems, which impose an additional constraint on the usual Huffman tree, arise in many applications, including computer file searching and the construction of optimal prefix codes under certain practical conditions.

Optimum binary search trees

Optimum binary search trees

Least upper bound on the cost of optimum binary search trees

This paper gives the least upper bound on the weighted path length of an optimum lexicographic (alphabetic) binary search tree as a function of n, given the total weight of the n terminal nodes and the n--1 internal nodes to be one.

Optimum binary search trees

Optimum binary search trees