Huffman and Shannon–Fano Codes

Building an optimal prefix code symbol by symbol, proving it optimal, and seeing where the older Shannon–Fano construction falls short.0/11 mastered

1 / 11

For an alphabet of size m, what is the longest possible Huffman codeword, in bits, when m = 12?