Visualization
Enter text and click Start to begin
Algorithm Steps
1. Calculate Frequencies
Count character occurrences
2. Create Leaf Nodes
Node for each character
3. Build Priority Queue
Sort by frequency (asc)
4. Merge Nodes
Combine lowest frequencies
5. Generate Codes
Traverse: left=0, right=1
6. Encode Text
Replace with Huffman codes
Time
O(n log n)
Space
O(n)