Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
In this paper we consider a special kind of binary trees where each right edge is associated with a positive number α and each left edge with a positive number β(α ≦ β). Given α, β and the number of nodes n, an optimal tree is one which minimizes the total weighted path length. An algorithm for constructing an optimal tree for given α, β, n is presented, based on which bounds for balances and total weighted path lengths of optimal trees are derived. © 1977 BIT Foundations.
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Imran Nasim, Michael E. Henderson
Mathematics