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 n = 1e = 1s = 1SPACE = 1h = 1u = 1 a = 1m = 1f = 2t = 2

5. Step 2: Initialize Nodes n1n1 e1e1 s1s1 Space 1 h1h1 u1u1 a1a1 m1m1 f2f2 t2t2

6. Step 3: Merge Lowest Frequencies n1n1 e1e1 s1s1 Space 1 h1h1 u1u1 a1a1 m1m1 f2f2 t2t2

7. Continue to Merge Lowest Frequent s1s1 SP1SP1 h1h1 u1u1 a1a1 m1m1 f2f2 t2t2 2 1 e1e1 0 n1n1

8. h1h1 u1u1 a1a1 m1m1 f2f2 t2t2 2 1 e1e1 0 n1n1 2 1 SP 1 0 s1s1

9. Continue to Merge Lowest Frequent a1a1 m1m1 f2f2 t2t2 2 1 e1e1 0 n1n1 2 1 SP1SP1 0 s1s1 2 1 u1u1 0 h1h1

10. f2f2 t2t2 2 1 e1e1 0 n1n1 2 1 SP1SP1 0 s1s1 2 1 u1u1 0 h1h1 2 1 m1m1 0 a1a1

11. 2 1 e1e1 0 n1n1 2 1 SP1SP1 0 s1s1 2 1 u1u1 0 h1h1 2 1 m1m1 0 a1a1 4 1 t2t2 0 f2f2

12. 2 1 u1u1 0 h1h1 2 1 m1m1 0 a1a1 4 1 t2t2 0 f2f2 4 1 2 1 SP1SP1 0 s1s1 0 2 1 e1e1 0 n1n1

13. 4 1 t2t2 0 f2f2 4 1 2 1 SP1SP1 0 s1s1 0 2 1 e1e1 0 n1n1 4 1 2 1 m1m1 0 a1a1 0 2 1 u1u1 0 h1h1

14. 4 1 2 1 m1m1 0 a1a1 0 2 1 u1u1 0 h1h1 8 1 4 1 2 1 SP1SP1 0 s1s1 0 2 1 e1e1 0 n1n1 0 4 1 t2t2 0 f2f2

15. 1212 1 8 1 4 1 2 1 SP1SP1 0 s1s1 0 2 1 e1e1 0 n1n1 0 4 1 t2t2 0 f2f2 0 4 1 2 1 m1m1 0 a1a1 0 2 1 u1u1 0 h1h1

16. Huffman Codebook SPACE = 0000 e = 0010 u = 110 n = 0011 t = 010 m = 100 f = 011 h = 111 a = 101 s = 0001

17. Original File test huffman

18. Encoded Output Bits 0100010000101000001111100110111001010011

19. Final Output File SPACE = 0000 e = 0010 u = 110 n = 0011 t = 010 m = 100 f = 011 h = 111 a = 101 s = 0001 0100010000101000001111100110111001010011

20. The End Huffman Encoding Automated Visualization by Chris Fremgen