Is there a correct way to create a tree to implement Huffman coding, specifically for compressing a string. I have a function to do this and with an example string I get the fol
