Huffman Coding (Part-2) - Variable Length Coding

Huffman Coding is one of the widely used compressing methods and this is the second part of this coding system where you will learn the variable-length type of this system.

The answer to the sample question: As you have seen, the left branch of each node is represented by the "0" bit and the right-sided branch by the "1" bit number. Hence, O
"0" / \ "1"
O O
\ "1"
O
"0" / \ "1"
O O
-c- -d-

which gives us, c = "110"; ans: C. 110