How to decompress a string in huffman coding?

Question

I compressed the "abc" word into "01100111" using haffman coding algorithm . I built the tree . According to tree a=01, b=100 , c=111 . how to decompress this word ?

Answer 1

That is not a Huffman code. A Huffman code is a prefix code that uses all possible bit patterns. The prefixes 00, 101, and 110 are not used.

To decode a prefix code, you effectively traverse the tree starting at the root until you get to a leaf. Then you emit the symbol at the leaf and start over again at the root.