Huffman Coding - Optimal Prefix Codes
Goal: Optimal prefix-free binary codes based on frequency
Greedy: Always merge two nodes with smallest frequencies
• Frequent chars get shorter codes
• No code is prefix of another
Time: O(n log n)
O(n log n)