哈夫曼编码译码

#include<bits/stdc++.h>
using namespace std;
typedef struct
{
   
    int weight;
    char ch;
    int parent,lchild,rchild;
}HNode,*HTree;
typedef char **HCode;
char code[1000];
void Select(HTree H,int n,int &n1,int &n2)//选出最小的两个树
{
   
    int min=0x3f3f3f3f;
    for(int i=0;i<n;i++)
        if(H[i].parent==0&&H[i].weight<min)
        {
   
            n1=i;
            min=H[i].weight;
        }
    min=0x3f3f3f3f;
    for(int i=0;i<n;i++)
        if(H[i].parent==0&&H[i].weight<min&&i!=n1)
        {
   
            n2=i;
            min=H[i].weight;
        }
}
void GreatHTree(HTree &H,int n)//创建哈夫曼树
{
   
    int n1,n2,m=2*n-1;
    H=