论文信息 - Generalized binary split trees

Generalized binary split trees

SummaryThe definition of binary split trees is generalized by removing the condition of decreasing frequency. It is shown that the access time of generalized split trees is less than that of split trees in general. The optimal representation of generalized split trees is studied. A polynomial time algorithm to construct such optimal tree structures is given. The relationship among several classes of binary trees are also discussed.

Chak-Kuen Wong | Shou-Hsuan Stephen Huang | Chak-Kuen Wong | S. S. Huang

[1] Donald E. Knuth,et al. The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[2] D. Wood,et al. The construction of optimal multiway search trees and the monotonicity principle , 1981 .

[3] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[4] F. Frances Yao,et al. Efficient dynamic programming using quadrangle inequalities , 1980, STOC '80.

[5] B. A. Sheil,et al. Median split trees: a fast lookup technique for frequently occuring keys , 1978, CACM.

[6] Chak-Kuen Wong,et al. Optimal Binary Split Trees , 1984, J. Algorithms.

[7] Kurt Mehlhorn,et al. Nearly optimal binary search trees , 1975, Acta Informatica.

[8] Donald E. Knuth,et al. Optimum binary search trees , 1971, Acta Informatica.

[9] Douglas Comer. A Note on Median Split Trees , 1980, TOPL.