建立哈夫曼树，求哈夫曼编码

/*建立哈夫曼树，就是每次从所有节点中选取两个权值最小且没有父亲的节点
 *然后用这两个节点作为新节点的两个子树，新节点的权值等于两子树之和
 *重复这个操作直到所有总节点数等于2*n-1
 *
*/
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;


typedef struct node{
    int weight;
    int parent,lchild,rchild;
}HTNode,*HaffmanTree;

typedef char **HaffmanCode;

void select(HaffmanTree T, int n, int *s1, int *s2);    //选取haffmanTree中权重最小的两个节点位置
void haffmanCoding(HaffmanTree *T, HaffmanCode *HC, int *w, int n); //建立haffmantree，求haffmancode

void select(HaffmanTree T, int n, int *s1, int *s2){
    int min=32767,nmin=32767;
    int vmin=0,vnmin=0;
    for(int i=0; i<n; i++){
        if(T[i].parent!=0) continue;
        if(min>T[i].weight){
            min = T[i].weight;
            vmin = i;
        }else if(nmin>T[i].weight){
            nmin = T[i].weight;
            vnmin = i;
        }
    }

    *s1 = vmin,*s2 =