Huffman Coding Analysis

It is optimal code that is commonly used for lossless data compression (reduces file sizes). It uses greedy algorithms approach. Lossless means without loss of information.

There are mainly two major parts in Huffman Coding
1) Build a Huffman Tree from input characters.
2) Traverse the Huffman Tree and assign codes to characters.

Let's say we are considering a chart with few characters. Every char is 8 bits long.

Now after Huffman Coding we get the chart like this:
Character       Frequency     Occurance
A                      1100                 4
B                      1101                 4
C                      100                  3
D                      101                  3
E                      111                  3
F                      0                      1

Total Occurance only 4+4+3+3+3+1 = 18 bits only

So, without Huffman Coding total bits = 144
      After Huffman Coding total bits = 18
 

This way Huffman Coding reduces /compress data (file) size.