1. Huffman Encoding Visualization
Auto-Generated Slides To Visualize Huffman Encoding by Chris Fremgen

3. Original File
test huffman

4. Step 1: Get Frequencies of Letters
a = 1 m = 1 f = 2 t = 2

5. Step 2: Initialize Nodes1 1 1 1 1 1 1 1 2 2

6. Step 3: Merge Lowest Frequencies1 1 1 1 1 1 1 1 2 2

7. Continue to Merge Lowest Frequent2 1 1 1 1 1 1 1 1 1 2 2

8. Continue to Merge Lowest Frequent2 2 1 1 1 1 1 1 1 1 1 1 2 2

9. Continue to Merge Lowest Frequent2 2 2 1 1 1 1 1 1 1 1 1 1 1 2 2

10. Continue to Merge Lowest Frequent2 2 2 2 1 1 1 1 1 1 1 1 1 1 1 1 2 2

11. Continue to Merge Lowest Frequent2 2 2 2 4 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2

12. Continue to Merge Lowest Frequent2 2 4 4 1 1 1 1 1 1 1 1 2 2 2 2 1 1 1 1 1 1

13. Continue to Merge Lowest Frequent4 4 4 1 1 1 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 1 1

14. Continue to Merge Lowest Frequent4 8 1 1 2 2 4 4 1 1 1 1 1 1 1 1 2 2 2 2 1 1 1 1 1 1

15. Continue to Merge Lowest Frequent12 1 4 8 1 1 2 2 4 4 1 1 1 1 1 1 1 1 2 2 2 2 1 1 1 1 1 1

16. Huffman Codebook
f = 011 h = 111 a = 101 s = 0001

17. Original File
test huffman

18. Encoded Output Bits

19. Final Output File

20. The End
Huffman Encoding Automated Visualization by Chris Fremgen