I am working on an assignment which has me build a huffman tree. I am fairly confident that I have built my huffman tree correctly, but now I must get the Huffman code for the characters being encoded (I need to get the 1's and 0's). I am not sure how to do this. The tree does not seem to be in any particular order. Do I need to just try a path and if I don't find it, try the other way, or is there some other way I can use? Thanks for any help in advance.