说明：  对任意输入的一段英文，为每个字符编制其相应的赫夫曼编码；并利用该编码为任意输入的0、1序列进行解码.（1）初始化： 从终端读入一段英文字符，统计每个字符出现的频率，建立赫夫曼树，并将该树存入某文件；（2）编码： 利用建好的赫夫曼树对各字符进行编码，用列表的形式显示在屏幕上，并将编码结果存入另一文件中；（3）解码:利用保存的赫夫曼编码，对任意输入的0，1序列能正确解码。
(A section of the indiscriminate importation of English, for each character the preparation of their corresponding Huffman coding and use the coding for arbitrary input sequence decoding 0,1. (1) Initialization: read from the terminal section of the English characters, statistical frequency of each character, the establishment of Huffman tree, and the tree into a document (2) Coding: Using the Huffman tree is built on the character encoding, using the list displayed on the screen and coding the results into another document (3) decoder: Using saved Huffman coding, for arbitrary input sequences correctly decode 0,1.)