哈夫曼树（最小堆实现）

哈夫曼树：根据节点的查找频率构建更有效的搜索树
如何构造哈夫曼树：每次从堆中拿出两个权值最小的节点组成新的节点，并放入堆中。重复直到堆中只剩一个元素。
难点在于要保存每次合并后的新节点的地址（在哈夫曼树中的地址）
代码：

//用最小堆来实现哈夫曼树的建立
//哈夫曼树简介：根据结点的额不同查找频率构造的更有效的搜索树
//用最小堆来实现哈夫曼树的建立
//哈夫曼树简介：根据结点的额不同查找频率构造的更有效的搜索树
#include<iostream>
#include<stdio.h>
#include<vector>
#include<stdlib.h>
using namespace std;
typedef struct tree{
    int val;
    struct tree *left ,*right;
}tree;
typedef struct {
    int val;
    tree *p;
}h;
vector<h>minheap;
int n;//最小堆总数
int recover(int i) {//最小堆恢复
    if (i > n/2) {
        return 0;
    }
    int flag,min;
    if (i*2+1 > n) {
        min = minheap[i*2].val;
    }
    else {
        min = minheap[i*2].val < minheap[i*2+1].val?minheap[i*2].val:minheap[i*2+1].val;
    }
    if (minheap[i*2].val < minheap[i*2+1].val) {
        flag = 1;
    }
    else {
        flag = 2;
    }
    if (minheap[i].val > min) {
        h swap = minheap[i];
        if (flag == 1) {
            minheap[i] = minheap[i*2];
            minheap[i*2] = swap;
        }
        else {
            minheap[i] = minheap[i*2+1];
            minheap[i*2+1] = swap;
        }
    }
    recover(i*2);
    recover(i*2+1);
}
void create() {//建堆
    int i;
    for (i = 1;i <= n;i++) {
        cin>>minheap[i].val;    
    }
    for (i = n/2;i > 0;i--) {
        recover(i);
    }
}
void prin() {//打印堆
    cout<<n<<endl;
    for (int i = 1;i <= n;i++) {
        cout<<minheap[i].val<<",";
    }
    cout<<endl;
}
void deleteheap() {//删除堆顶元素
    minheap[1] = minheap[n];
    n--;
    recover(1);
}

void insert(int num,tree *root) {//向堆中插入元素
    ++n;
    minheap[n].val = num;
    minheap[n].p = root;
    minheap[n].p->val = num;
    int flag,i;
    h swap;
    for (i = n;i > 1;i/=2) {//向上找
        flag = i/2;
        if (minheap[flag].val > minheap[i].val) {
            swap = minheap[flag];
            minheap[flag] = minheap[i];
            minheap[i] = swap;
        }
        else {
            break;
        }
    }
}
tree* createhfm(){//哈夫曼树的创建
    while(n != 1) {
        tree *num1 = minheap[1].p;
        deleteheap();
        tree *num2 = minheap[1].p;
        deleteheap();
        //cout<<num1->val<<" "<<num2->val<<endl;
        tree *root = (tree*)calloc(1,sizeof(tree));
        root->val = num1->val + num2->val;
        root->left = num1;
        root->right = num2;
        insert(root->val,root);
    }
}
void prinhfm(tree *root) {//打印哈夫曼数（中序）
    if (root != NULL) {
        prinhfm(root->left);
        cout<<root->val<<" ";
        prinhfm(root->right);
    }
}
void destroy(tree *root) {
    if (root != NULL) {
        destroy(root->left);
        destroy(root->right);
        free(root);
    }
}
int main() {
    cout<<"请输入最小堆的总数";
    cin>>n;
    minheap.resize(n+1);
    minheap[0].val = 10000;
    create();
    fprintf(stderr,"haha");
    for (int i = 1;i <= n;i++) {
        minheap[i].p = (tree*)malloc(sizeof(tree));
        minheap[i].p->val = minheap[i].val;
        minheap[i].p->left = NULL;
        minheap[i].p->right = NULL;
    }
    cout<<"最小堆遍历:\n";
    prin();
    //创建哈夫曼树:
    createhfm();
    cout<<"哈夫曼树中序遍历:\n";
    prinhfm(minheap[1].p);
    destroy(minheap[1].p);
    return 0;
}