构造一颗霍夫曼树,输入叶子节点的字符及权重，输出字符对应的Huffman编码，还可以通过输入0.1编码翻译出对应的字符-Hoffman Construction of a tree, enter the leaf nodes and the weights of the characters, the output of the Huffman code corresponding characters can be translated by entering the correspondin