🔤 Huffman Encoding
USACO C++ Book · Interactive Visualizer
🌳 Huffman Coding — Greedy Optimal Prefix Tree
Greedy
Min-Heap
Step 0/5
📊 Huffman Tree Construction
🗂 Min-Heap State
Priority Queue (min-heap)
Current Operation
Cumulative Cost
Time:
O(N log N)
Per merge:
O(log N)
💻 Code
◀ Prev
Next Step ▶
↺ Reset
0/5
Keyboard:
→
Next
←
Prev
R
Reset