Abstract
In this paper we construct binary trees optimal under various criteria. In particular, we show that Hu–Tucker type algorithms can be used to find trees, whose leaves preserve a given order, that minimize certain sums of functions of path length, and also that minimize certain maximum functions of path length. The arguments are based on a new proof of the original Hu–Tucker algorithm.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
