在电报通讯中，电文是以二进制的0、1序列传送的。字符集中的字符的使用频率是不同的（比如e和t的使用较之q和z要频繁得多），哈夫曼编码可以使得编码的总长最短，从而相同的位长可以传送更多的信息。本程序用c语言来仿真哈夫曼编码的过程，其中运用动态分配数组存储哈夫曼树和动态分配数组存储哈夫曼编码表等c语言常用知识。另外，程序中包含极其详细的注解，十分有利于学习。

-Telegraph communications, the message is binary 0, 1 sequence transmitted. The frequency of use of the character set is different (such as the use of e and t, compared to q, and z is far more frequent), Huffman encoding of the length of the shortest, and thus the same bit length can be sent more information . This procedure to the simulation process of Huffman coding using c language, including the use of dynamically allocated array to store the Huffman tree and dynamically allocated array storage Huffman coding table c language commonly used in knowledge. In addition, the program contains extremely detailed comments, very conducive to learning.