论文信息 - On the costs of optimal and near-optimal binary search trees

On the costs of optimal and near-optimal binary search trees

SummaryWe show that the cost of an optimal binary search tree can vary substantially, depending only on the left-to-right order imposed on the probabilities. We also prove that the costs of some common classes of near-optimal trees cannot be bounded above by the cost of an optimal tree plus a constant.

Brian Allen

[1] M. V. Wilkes,et al. The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

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

[3] Michael L. Fredman,et al. Two applications of a probabilistic search technique: Sorting X+Y and building balanced search trees , 1975, STOC.

[4] Kurt Mehlhorn,et al. A Best Possible Bound for the Weighted Path Length of Binary Search Trees , 1977, SIAM J. Comput..