About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Abstract
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.