Ok, I realize I probably did this the hard way, but I'm having a small problem with this huffman tree thing. I wrote a program that reads in a char and it's frequency count, puts each in a linked list, sorts it, then combines elements until a tree is built.
Looking at various examples, I have perfected it to build trees that correspond with the examples.
Now I need to know, how the heck do I traverse the thing? For example, if I want to find the node containg 'a', how do I get to it wihtout searchign the whole tree (which could be VERY time consuming). Any ideas?
