1986•International Journal of Computer MathematicsRequires access
Optimal binary search trees
Włodzimierz Dobosiewicz
Open publisher page 2 citations
Abstract
Optimal binary search trees are described in practically every textbook on data structures. It is commonly accepted that since the publication of the paper by Knuth everything about them is known and understood. This paper shows that it is not necessarily so, and that, in particular, “optimal binary search trees” as normally defined are not optimal at all. Various types of optimal split trees are more efficient than optimal search trees as defined by Knuth.