哈夫曼树

typedef struct TreeNode *HuffmanTree;
struct TreeNode {
    int Weight;
    HuffmanTree Left, Right;
};
HuffmanTree Huffman(MinHeap H) {
    BulidMinHeap(H);
    for (int i = 1; i < H->Size; ++ i) {
        HuffmanTree T = (HuffmanTree)malloc(sizeof(struct TreeNode));
        T->Left     = DeleteMin(H);
        T->Right    = DeleteMin(H);
        T->Weight   = T->Left->Weight + T->Right->Weight;
        Insert(H, T);
    }
    return DeleteMin(H);
}