实现构造哈夫曼树的哈夫曼算法。
要求:可以建立函数输入二叉树,并输出其赫夫曼树。
Requirements: function can be established Binary tree imported and exported its Hefuman tree.
该算法使用固定奇偶码,省去了传统算法动态生成哈夫曼树的繁琐过程;
The algorithm uses a fixed set of complementary parity codes to replace the encoding table that dynamically generated by the traditional Huffman method.
应用推荐