Summary
We consider a specific kind of binary trees with weighted edges. Each right edge has weight α while each left edge has weight β. Furthermore, no path in the tree is allowed to contain L or more consecutive α-edges, where L ≧ 1 is fixed. Given, α, β, L and the number of nodes n, an optimal tree is one which minimizes the total weighted path length. Algorithms for constructing an optimal tree as well as all optimal trees for given α, β, L and n are proposed and analyzed. Timing and storage requirements are also discussed.
Similar content being viewed by others
References
Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Informat. 1, 173–189 (1972)
Choy, D.M., Wong, C.K.: Optimal α-β binary trees. IBM Research Report RC5771, December 1975
Choy, D.M., Wong, C.K.: Bounds for optimal α-β binary trees. Nordisk Tidskr. Informations-behandling (BIT) 17, 1–15 (1977)
Knuth, D.E.: The art of computer programming, Vol. 1, 2nd ed. Reading, Mass.: Addison-Wesley 1973
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Choy, D.M., Wong, C.K. Optimal α-β trees with capacity constraint. Acta Informatica 10, 273–296 (1978). https://doi.org/10.1007/BF00264321
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00264321