在数据结构中哈夫曼树是重要的数据结构，尤其是在通信编码中发挥着重要的作用，该文件包含两种计算哈夫曼树权值的方法，一种是先将权值排序，存放在链表中，每次从链表中取出前两个结点，计算其和，再将和插入到链表的适当位置上；另一种方法是使用Hash。-In Huffman tree data structure is an important data structure, especially plays an important role in the communication encoding, the file contains two methods of calculating the weight of the Huffman tree, the first one is sort weights, stored in the list, to remove from the list each time the first two nodes, and calculated, and then inserted into the appropriate position in the list　another method is to use a Hash.