Efficient Construction of Near-Optimal Binary and Multiway Search Trees

Authors:
Prosenjit Bose;Karim Douïeb
Affiliations:
School of Computer Science, Carleton University, Ontario, Canada K1S 5B6;School of Computer Science, Carleton University, Ontario, Canada K1S 5B6
Venue:
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Year:
2009

Citing 5
Cited 0

On binary search trees

Information Processing Letters
New lower bounds on the cost of binary search trees

Theoretical Computer Science
A new algorithm for the construction of optimal B-trees

Nordic Journal of Computing
Construction of Nearly Optimal Multiway Trees

COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Biased 2-3 trees

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new linear-time algorithm for constructing multiway search trees with near-optimal search cost whose running time is independent of the size of the node in the tree. With the analysis of our construction method, we provide a new upper bound on the average search cost for multiway search trees that nearly matches the lower bound. In fact, it is tight for infinitely many probability distributions. This problem is well-studied in the literature for the case of binary search trees. Using our new construction method, we are able to provide the tightest upper bound on the average search cost for an optimal binary search tree.