哈夫曼编码是不等长编码。利用哈夫曼编码能实现了数据的压缩，在进行通信时，可以大大提高信道利用率，缩短信息传输的时间。本实习要求对发送端待发送的信息进行哈夫曼编码，在接收端进行解码，还原为原来的信息。测试数据：自己找一段不小于2000字符的英文文章，保存为文件。(1) 所有信息输入与输出要以图形化的可视界面，如：用对话框选择打开的文件、字符的出现频率的统计信息能以文件的方式保存，能以表格的形式输出到显示器等。(2) 编码后的信息要以文件的方式保存。能比较编码前和解码后的两个文件是否一致。 (3) 能将建立的哈夫曼树以图形的方式显示。(The Huffman code is a unequal length encoding. The data compression can be realized by Huffman code. When communication is carried out, the channel utilization rate can be greatly improved and the time of information transmission can be shortened. This practice requires the Hoffman code for the message to be sent at the sending end, decode it at the receiving end and restore it to the original information. Test data: find an English article that is not less than 2000 characters, and save it as a document. (1) all information input and output should be graphical visual interface, such as selecting open files with dialog boxes, the statistical information of the frequency of characters can be saved in file mode, and can be output to the monitor in form. (2) the encoded information should be saved in the form of a file. Can compare whether the two files before and after the encoding are consistent. (3) the Hoffman tree can be displayed in a graphic manner.)