HuffmanTree.java

The Huffman class takes in the sentence u want compressed and prints out the ASCII values of the letters and the frequencies of the numbers, it then creates a PriorityQueue tree  to hold the frequencies and the it starts to combine the two smallest ones together in a combo tree with left and right child, this is continues till we have the full tree, we then get the new binary values of each letter and compare that to the original binary values to find how much they have been compressed.