Abstract A binary split tree is a search structure combining features of heaps and binary search trees. Building an optimal binary split tree was originally conjectured to be intractable due to difficulties in applying dynamic programming techniques to the problem. However, two algorithms have recently been published which generate optimal trees in O ( n 5 ) time, for records with distinct access probabilities. An extension allowing nondistinct access probabilities required exponential time. These algorithms consider a range of values when only a single value is possible. A dynamic programming method for determining the correct value is given, resulting in an algorithm which builds an optimal binary split tree in O ( n 5 ) time for nondistinct access probabilities and Θ ( n 4 ) time for distinct access probabilities.
[1]
Yehoshua Perl,et al.
Optimum Split Trees
,
1984,
J. Algorithms.
[2]
Chak-Kuen Wong,et al.
Optimal Binary Split Trees
,
1984,
J. Algorithms.
[3]
F. Frances Yao,et al.
Efficient dynamic programming using quadrangle inequalities
,
1980,
STOC '80.
[4]
B. A. Sheil,et al.
Median split trees: a fast lookup technique for frequently occuring keys
,
1978,
CACM.