说明：  根据对二叉树知识的理解,实现对最优二叉树哈夫曼树的构造,遍历,然后实现编码,译码的功能,结果保存到文件中. 输入要进行编码的字符段,统计对字符的出现次数即为权值,根据权值建立哈夫曼树,由哈夫曼树可得到各字符的编码,反过来可得数字译码,保存到文件中
(Based on a binary tree of knowledge of understanding, to achieve the optimal Huffman tree binary tree structure, traverse, and then the realization of encoding, decoding functions, the results saved to file. Enter the characters above coding, statistics The emergence of the number of characters is the right value, in accordance with established weight Huffman tree, from the Huffman tree can be the character encoding, which in turn can be a digital decoder, save to a file)