论文信息 - Least upper bound on the cost of optimum binary search trees

Least upper bound on the cost of optimum binary search trees

SummaryThis 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.

K. C. Tan | T. C. Hu

[1] Clark A. Crane,et al. Linear Lists and Prorty Queues as Balanced Binary Trees , 1972, Outstanding Dissertations in the Computer Sciences.

[2] T. C. Hu,et al. Optimal Computer Search Trees and Variable-Length Alphabetical Codes , 1971 .

[3] T. C. Hu,et al. Path Length of Binary Search Trees. , 1972 .

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