Summary
Design and analysis of sorting and searching algorithms lead to the study of rooted trees with information stored either at the leaves or at all vertices. We consider the problem of minimising the maximum search cost when n items must be stored. Trees which achieve this minimum are almost regular and can usually be found in constant time. If regular trees are used, the maximum cost for a search is nearly best possible. If information is stored at all vertices, the root degree of large optimum trees take on one of two adjacent values, and both usually occur infinitely often for linear cost.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Eades, P.: Regularity and optimality for trees. Lect. Notes Math. 884. Proc. Eighth Austral. Conf. on Combin. 1980. Berlin, Heidelberg, New York: Springer 1981
Eades, P.: Further results on optimal trees. Ars. Comb. 14, 213–224 (1982)
Eades, P., Jones, L.: A family of optimal trees. Ars. Comb. 12, 37–45 (1981)
Eades, P., Staples, J.: On optimal trees. J. Algorithms 2, 369–384 (1981)
Göbel, F., Hoede, C.: On an optimality property of ternary trees. Inf. Control 42, 10–26 (1979)
Goldschlager, L.M., Eades, P.D.: Cheapsort. Dept. of Computer Sci. Tech. Rpt. No. 11, Univ. Queensland 1979
Hyafil, L.: Thèse de 3ème cycle. Université de Paris VI (1974)
Hyafil, L., Prusker, F., Vuillemin, J.: An efficient algorithm for computing optimal disk merge patterns (extended abstract). Proc. Sixth Annual ACM Symp. Comput., pp. 216–229. New York: Assoc. Comput. Mach. 1974
Hyafil, L., Prusker, F., Vuillemin, J.: Design of optimal merge on direct access devices. Inf. Proc. 74. Proceedings of the IFIP Congress, pp. 979–982. Amsterdam: North-Holland 1974
Knuth, D.E.: The Art of Computer Programming III. Sorting and Searching, pp. 361–373. Addison-Wesley, Reading, MA, 1973
Niven, I.: Diophantine Approximations. New York: Wiley-Interscience 1963
Okoma, S.: Generalized Heapsort. Lect. Notes Comput. Sci. 88. Proc. Ninth Symp. on Math. Found, of Comp. Sci. 1980 (P. Dembihski, ed.), pp 439–451. Berlin, Heidelberg, New York: Springer 1980
Author information
Authors and Affiliations
Additional information
Research supported by NSF under grants MCS-7927060 and MCS-8300414
Research supported by the Australian Department of Science and Technology under the Queen Elizabeth II Fellowship Scheme, while this author was at the University of Newcastle, N.S.W.
Rights and permissions
About this article
Cite this article
Bender, E.A., Praeger, C.E. & Wormald, N.C. Optimal worst case trees. Acta Informatica 24, 475–489 (1987). https://doi.org/10.1007/BF00292115
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00292115