数据结构之霍夫曼树，采用霍夫曼树

（1）根据输入的字符和相应的权值建立哈夫曼树，并输出已建的相应内容作为检查；

（2）用哈夫曼树实现前缀编码，并输出各字符的编码串；

（3）输入一组二进制报文，进行译码，并输出译文。

-Huffman tree data structures, using Huffman tree (1) according to the input character and the corresponding weights build the Huffman tree, and outputs the corresponding content has been built as a check　(2) with a Huffman tree implementation prefix code, and outputs the encoded string each character　(3) a set of binary input packet decoding and output translation.