Consider the following Huffman encoding tree: The letter H will be encoded as ____.
A)010
B)001
C)011
D)000

Question

Consider the following Huffman encoding tree:  The letter H will be encoded as ____. 
A)010 
B)001 
C)011 
D)000

Quizplus · Accepted Answer

To find the Huffman code for letter H, we follow the path from the root to the leaf node representing H. 
Starting at the root, we go left if the bit is 0 and right if the bit is 1. 
Going left, the first bit is 0, so we go left again. 
The second bit is 0, so we go left again. 
The third bit is 1, so we go right this time. 
Finally, we reach the leaf node representing H, and the code we have followed is 001.

Consider the Following Huffman Encoding Tree: the Letter H