About

You are given a simple text file with only letters. Your goal is to compress the file into binary using a Huffman coding tree with the most frequently used characters at the top. You will be asked to return the address of the least-used character as a string.

Stars

Watchers

Forks