哈夫曼树的建立

哈夫曼树的定义：带权路径长度（WPL）最小的二叉树

哈夫曼编码：总的字符编码长度最短，所有字符均在叶子节点，可以防止前缀编码的二义性。

class TreeNode{
int weight;
TreeNode left,right;
}

TreeNode Huffman(Minheap H){
    buildMinHeap(H);
    for(int i=1;i<H.size-1;i++){
        TreeNode T = new TreeNode();
        T.left = deleteMin(H);
        T.right = deleteMin(H);
        T.weight = T.left.weight+T.right.weight;
        insert(H,T);
    }
    return T;
}