按照一定的规则构造哈弗曼树，使得输入的元素都作为叶子节点，然后从叶子到根逆向球每个字符的哈弗曼编码-According to certain rules of construction Havermann tree, making the input element as a leaf node, and then reverse the ball from the leaf to the root code for each character Havermann