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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
