在Python 3.x中遍历霍夫曼代码树

Question

I am trying to generate inorder and preorder traversals of a Huffman Code Tree in python. I seem to have hit a wall though. I need to generate the traversals and write them to corresponding files, and then create a binary path to the locations of each node and output that to a file as well. Here is what I have so far

Answer 1

Here is a PDF file of a lecture given for a course at Harvard (easily found by simple google search.) It provides examples, explanations, pictures of trees, and code to do what you are asking to do. But the code is in Java. However, you should be able to translate these short programs to Python easily. Or just code Python directly from the explanations. It includes Huffman trees.

http://www.fas.harvard.edu/~cscie119/lectures/trees.pdf