（1）接收原始数据： 从终端读入字符集大小n，n个字符和n个权值，建立哈夫曼树，存于文件hfmtree.dat中。

（2）编码： 利用已建好的哈夫曼树（如不在内存，则从文件hfmtree.dat中读入）对文件中的正文进行编码，然后将结果存入文件codefile.dat中。

（3）译码： 利用已建好的哈夫曼树将文件codefile.dat中的代码进行译码，结果存入文件textfile.dat 中。

（4）打印编码规则：即字符与编码的一一对应关系。

（5）打印哈夫曼树：将已在内存中的哈夫曼树以直观的方式显示在终端上。-(1) to receive the raw data: Reading from the terminal into the character set size of n, n and n characters of the right value, the establishment of Huffman tree, stored in a document in hfmtree.dat. (2) Coding: Using the Huffman tree has been completed (such as not to memory, read from the document hfmtree.dat income) on the body of the document is encoded, and then the results into a document in codefile.dat. (3) Decoding: The Huffman tree has been built in the document codefile.dat code decoding, resulting in a document deposited in textfile.dat. (4) Print coding rules: that is, the characters one-to-one relationship with the coding. (5) Print Huffman tree: will have been in memory of the Huffman tree intuitive way to show that in terminal.