赫夫曼编码，实现压缩编码，字符码长 察看权值，以此构建二叉树-Huffman coding, achieving compression coding, characters yards long to see the right value, this Binary Tree Construction

实现哈弗曼编码及其压缩。对一个文本文件中的字符进行哈夫曼编码，生成编码文件（后缀名.cod）；反过来，可将一个编码文件还原为一个文本文件(.txt)。-Encoding and compression to achieve Hafu Man. A text file on the characters in the Huffman code, generate code files (suffix. Cod) in turn, can restore an encoded file as a

数据结构实验：设计一个基于哈夫曼树的数据压缩程序，根据给定的待压缩文件中字符出现的频率建立相应哈夫曼树，构造哈夫曼编码表，在此基础上可以对待压缩文件进行压缩（即编码），同时可以对压缩后的二进制编码文件进行解压（即译码）-Experimental data structure: a design based on Huffman data compression program, to establish the corresponding Huffman tree based on the fr