初学数据结构（哈夫曼树的构造以及哈夫曼编码）

初学数据结构（哈夫曼树的构造以及哈夫曼编码）

《数据结构教程》P243 exp7-5

//
// Created by Snow on 2023/4/6.
//
#include<cstdio>
#include<cstring>
#define N 20
#define M (2*N-1)
typedef struct
{
    char data[5];
    double weight;
    int parent;
    int lchild;
    int rchild;
}HTNode;
typedef struct
{
    char cd[N];
    int start;
}HCode;
void CreateHT(HTNode ht[],int n0)
{
    int i,k,lnode,rnode;
    double min1,min2;
    for(i=0;i<2*n0-1;i++)
        ht[i].parent=ht[i].lchild=ht[i].rchild=-1;
    for(i=n0;i<2*n0-2;i++)
    {
        min1=min2=32767;
        lnode=rnode=-1;
        for(k=0;k<=i-1;k++)
        {
            if(ht[k].parent==-1)
            {
                if(ht[k].weight<min1)
                {
                    min2=min1;
                    rnode=lnode;
                    min1=ht[k].weight;
                    lnode=k;
                }
                else if(ht[k].weight<min2)
                {
                    min2=ht[k].weight;
                    rnode=k;
                }
            }
        }
        ht[i].weight=ht[lnode].weight+ht[rnode].weight;
        ht[i].lchild=lnode;
        ht[i].rchild=rnode;
        ht[lnode].parent=i;
        ht[rnode].parent=i;
    }
}
void CreateHCode(HTNode ht[],HCode hcd[],int n0)
{
    int i,f,c;
    HCode hc;
    for(i=0;i<n0;i++)
    {
        hc.start=n0;
        c=i;
        f=ht[i].parent;
        while(f!=-1)
        {
            if(ht[f].lchild==c)
                hc.cd[hc.start--]='0';
            else
                hc.cd[hc.start--]='1';
            c=f;
            f=ht[f].parent;
        }
        hc.start++;
        hcd[i]=hc;
    }
}
void DispHCode(HTNode ht[],HCode hcd[],int n0)
{
    int i,k;
    double sum=0,m=0;
    int j;
    printf("输出哈夫曼编码:\n");
    for(i=0;i<n0;i++)
    {
        j=0;
        printf("%s:\t",ht[i].data);
        for(k=hcd[i].start;k<=n0;k++)
        {
            printf("%c",hcd[i].cd[k]);
            j++;
        }
        m+=ht[i].weight;
        sum+=ht[i].weight*j;
        printf("\n");
    }
    printf("\n 平均长度=%g\n",1.0*sum/m);
}
int main()
{
    int n=15,i;
    char str[][5]={"The","of","a","to","and","in","that","he","is","at","on","for","His","are","be"};
    double fnum[]={1192,677,541,518,462,450,242,195,190,181,174,157,138,124,123};
    HTNode ht[M];
    HCode hcd[N];
    for(i=0;i<n;i++)
    {
        strcpy(ht[i].data,str[i]);
        ht[i].weight=fnum[i];
    }
    printf("\n");
    CreateHT(ht,n);
    CreateHCode(ht,hcd,n);
    DispHCode(ht,hcd,n);
    return 0;
}

PS: %g用来输出实数，它根据数值的大小，自动选f格式或e格式（选择输出时占宽度较小的一种），且不输出无意义的0。即%g是根据结果自动选择科学记数法还是一般的小数记数法.