Bounds on the Number of Huffman and Binary-Ternary Trees

Angeline Rao, Ying Liu, Yezhou Feng +1

Huffman coding is a widely used method for lossless data compression because it optimally stores data based on how often the characters occur in Huffman trees. An $n$-ary Huffman t…