A simple implementation of Huffman Coding for text compression.

Basically, it encodes characters into binary codes. The binary codes are assigned based on the frequency of each character.

We applied the following method to build the Huffman Tree (from Wikipedia):

• pandas==0.25.1