🔤 Huffman Encoding
USACO C++ Book · Interactive Visualizer
🌳 Huffman Coding — Greedy Optimal Prefix Tree
Greedy
Min-Heap
Step 0/7
📊 Huffman Tree Construction (leaves=symbols, internal=merged freq)
🗂 Min-Heap State
Priority Queue (min-heap)
Current Operation
Cumulative Cost
Time:
O(N log N)
Per merge:
O(log N)
💻 Code
Tip
Click
Next Step ▶
to begin. Watch how Huffman always merges the two lowest-frequency nodes to build the optimal prefix tree.
◀ Prev
Next Step ▶
↺ Reset
0/7
Keyboard:
→
Next
←
Prev
R
Reset