Consider the following message: aabbbbabccdddccccbbdd If Huffman tree is coded as left child with ‘0’ and right child with ‘1’ from every node then what is the decoded message for 110100?

#1

Consider the following message: aabbbbabccdddccccbbdd
If Huffman tree is coded as left child with ‘0’ and right child with ‘1’ from every node then what is the decoded message for 110100?
PLease help

#2

first calculating the frequencies of a – 3, d-5, c-6, b-7 for message string that is given.

-Then adding in min priority queue with respect to their frequencies

-Dequeue until queue is not empty and make a huffman tree…

  • Huffman tree is :

  • Now four charecters ,so 4 combinations therefore we required 2 bits.

  • This 4 characters repeat 21 times,so total bits are required is 21 * 2 = 42.

  • For answer B , if we go left for 0 and right for 1 then

        11     -   right  –  right  = b

    01     - left  –   right     =  d

    00     - left   –  left       = a              Ans :-  **bda.**