For this project, you are to build a system capable of creating a Huffman 
coding tree.  I will provide you with a file containing 128 lines.  Each 
line contains three numbers, an ascii code, the number of characters
corresponding to that code in the novel Moby Dick, and the probabilities
of each of those occurring.

I will also provide you with some skeletons of useful classes that you will
want to finish implementing.

When you are done, choose a long file from project Gutenberg and compress it.
Count how many bytes it occupies and compare that to the original.

Try the same thing with a file written in a language other than English.