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

Huffman's algorithm merges nodes until one remains. For an alphabet of 4 symbols, how many merge steps does it perform?