Huffman Encoding Tool - challenge 4

Challenge 4

In order to encode text it must happen losslessly. Huffman encoding and decoding works by figuring out the frequencies of each character and then order characters in a binary tree by their frequencies. When searching a character you will assign a 1 for every move to the right and a 0 for every move to the left. The resulting bit string is the encoding of that letter. This will reduce the number of bits significantly (if you don't compress at all you will use 8 bits per character by default).