对一段文本构造哈夫曼树，对所有字符根据其权值编码。对每个结点的左分支编码为0，右分支编码为1。(Constructs a Huffman tree for a text, encodes all characters according to their weights. The left branch of each node is encoded at 0 and the right branch is encoded at 1.)