Question

Using Huffman tree in the Expression and Huffman Trees presentation, decode the following binary string using Huffman tree in the Expression and Huffman Trees presentation.

Use alternate colors to represent the individual letters and corresponding sub-string, separate sub-string by a blank space. You can do it by hand, scan and upload.

For example,

100010 1001 010

g    o   e

1100010001010001001011101100011111110001101010111101101001

Answer 1

Solution

100010 1001 010

g o e

1100010 0 010 10001 00101110110001111111000110101011110110 1001 (e)

110010 . does not match any of the alphabet, Please add more characters and its huffman code ?

Only g,o,e are given. PLEASE ADD MORE alphabet and huffman code

Please comment and I will modify if any changes are required