Huffman Coding

Builds an optimal prefix-free binary code by repeatedly merging the two lowest-frequency nodes into a tree.