Abstract
An algorithm is given for constructing a binary tree of minimum weighted path length and with restricted maximum path length. (Huffman’s tree is a binary tree of minimum weighted path length with no restriction on maximum path length.) When an alphabetical ordering of the terminal nodes is introduced, the binary tree is called an alphabetic binary tree. We show that Huffman’s algorithm for optimal binary trees coincides with the T-C algorithm for optimal alphabetic binary trees when the terminal nodes have monotonically increasing weights from left to right.
Published Version
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.
