#include<stdio.h>
#include<string.h>
#define N 50 //叶子结点数
#define M 2*N-1 //树中结点总数
#include<iostream>
using namespace std;
typedef struct
{
char data[5];//结点值
int weight; //权重
int parent; //双亲结点
int lchild; //左孩子结点
int rchild; //右孩子节点
}HTNode;
typedef struct
{
char cd[N]; //存放哈夫曼编码
int start; //ch[start..n]存放哈夫曼编码
}HCode;
void CreateHT(HTNode ht[],int n) //由ht的叶子结点构造完整的哈夫曼编码
{
int i,k,lnode,rnode;
int min1,min2; //所有节点的相关域置初值-1
for(i=0;i<2*n-1;i++)
ht[i].parent=ht[i].lchild=ht[i].rchild=-1;
for(i=n;i<2*n-1;i++) //构造哈夫曼树的分支结点
{
min1=min2=32767; //lnode和rnode为最小权重的两个结点位置
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[lnode].parent=i;ht[rnode].parent=i;
ht[i].weight=ht[lnode].weight+ht[rnode].weight;
ht[i].lchild=lnode;ht[i].rchild=rnode;
}
}
void CreateHCode(HTNode ht[],HCode hcd[],int n) //由哈夫曼树ht构造哈夫曼编码hcd
{ int i,f,c;
HCode hc;
for(i=0;i<n;i++) //根据哈夫曼树构造所有叶子结点的哈夫曼编码
{ hc.start=n;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++; //start指向哈夫曼树最开始的字符
hcd[i]=hc;
}
}
void DispHCode(HTNode ht[],HCode hcd[],int n) //输出哈夫曼编码
{ int i,k; int m=0,j=0;
int sum=0;
cout<<"输出哈夫曼编码:"<<endl;
for(i=0;i<n;i++)
{ j=0;
printf("%s:/t",ht[i].data);
cout<<ht[i].data<<endl;
for(k=hcd[i].start;k<=n;k++)
{
printf("%c",hcd[i].cd[k]);
// cout<<hcd[i].cd[k]<<endl;
j++;
}
m+=ht[i].weight;
sum=sum+ht[i].weight*j;
}
printf("/n平均长度=%g/n",1.0*sum/m);
cout<<"平均长度"<<1.0*sum/m<<endl;
}
int main()
{
system("color 00a");
int n=15,i;
char *str[]={"The","of","a","to ","and","in","that","he","is","at","on","for","His","are","be" };
int 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];
}
CreateHT(ht,n); //创建哈夫曼树
CreateHCode(ht,hcd,n);//构造哈夫曼树
DispHCode(ht,hcd,n); //输出哈夫曼树
return 1;
}
数据结构《哈夫曼树》课程设计
最新推荐文章于 2024-06-24 15:04:01 发布