Okay so I have a huffman tree whose leaves are all ASCII characters. I also have produced a code (in 0,1) for each of the leaves based on some test frequencies. But for some
