I have posted this thread once but don't see it appear in forum, so I post again.

I make the program that receives the input, then counts the frequency of the characters and makes the Huffman tree
After making the tree, I try to traverse all the tree from the root to every leaf.
The problem is, I don't know how to write the code to traverse the Huffman tree.

Do you have any idea?