哈夫曼树的构造算法-Huffman tree Construction Algorithm

给定n个权值作为n的叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树(Huffman tree)。哈夫曼树是带权路径长度最短的树，权值较大的结点离根较近。-Given n weights as a leaf node n, and construct a binary tree, if the weighted path length to a minimum, said such a binary tree is optimal binary tre