12.Huffman Coding
Huffman coding is a lossless data compression algorithm.
Consider the string ABRACADABRA.
Input characters are only present in the leaves. Internal nodes have a character value of ϕ (NULL). We can determine that our values for characters are:
Our Huffman encoded string is:
Huffman Decoding
Last updated