.
Huffman Tree Algorithm Example
Huffman Code - Example:
The following example basics using a data source utilizing some 5 different symbols. The symbol's frequencies tend to be:
| Symbol | Frequency |
|---|---|
| A | 24 |
| B | 12 |
| C | 10 |
| D | 8 |
| E | 8 |
| F | 186 (total bit) (with 3 bit per code word) |
The two rarest symbols “E” and “D” tend to be linked first, then “C” and “D”. The new parent nodes have the frequency 16 and 22 respectively and therefore are brought together within the next step. The resulting node and also the remaining symbol “A” are subordinated towards the root node that is created in a final step.
Code Tree according to Huffman
| Symbol | Frequency | Code | Code Length | Total Length |
|---|---|---|---|---|
| A | 24 | 0 | 1 | 24 |
| B | 12 | 100 | 3 | 36 |
| C | 10 | 101 | 3 | 30 |
| D | 8 | 110 | 3 | 24 |
| E | 8 | 111 | 3 | 24 |
| 186 bit (3 bit code) | 138 bit |
.
