赫夫曼编码本程序实现了使用赫夫曼编码压缩数据；输入一串字符串sourceCode——为方便理解，暂时要求字符串只包含大写字母和空格，如果你愿意，

很容易就可以推广到所有的字符——计算出字符串中各个字母的权重，然后对其进行赫夫曼编码，输出赫夫曼树。

将赫夫曼树的叶子结点存储到有序二叉树中，输出原字符串经压缩后得到的用 0 和 1 表示的新字符串destCode；

然后利用赫夫曼树将字符串destCode进行译码，得到目标字符串objCode，比较objCode和sourceCode，发现完全一样！

编码译码成功！-Huffman coding of the procedures for the use of Huffman coding to achieve data compression　input string string sourceCode- To facilitate the understanding of the temporary request string contains only capital letters and spaces, if you like, can easily be extended to all the characters- the string is calculated in the weight of all the letters, and then its Huffman codes, Huffman tree output. Huffman tree leaves to node binary tree stored in an orderly manner, the output of the original string to be compressed by the use of' 0 ' and' 1'　indicated that the new string destCode　Huffman tree and then use the character destCode for decoding strings, string target objCode, compared objCode and sourceCode, found exactly the same! Codec success!