文档介绍：哈夫曼树---实验报告
共 页 第 页
计算机科学与技术学院 数据结构 实验报告
班级 2023级计算机1班 学号 20234138021 姓名 张建华 成绩
{
string hfmstr; /*结点内容*/
int weight; /*结点权值*/
int parent;
int lchild;
int rchild;
}HNodeType;
typedef struct /* 编码结构体 */
{
int bit[MAXBIT];
int start;
}HCodeType;
void Create_HuffMTree(HNodeType HFMTree[],int n) /*创立哈夫曼树*/
{
int m1,x1,m2,x2;
共 页 第 页
int i,j;
for(i=0;i<2*n-1;i++)
{
HFMTree[i].hfmstr="";
HFMTree[i].weight=0;
HFMTree[i].parent=-1;
HFMTree[i].lchild=-1;
HFMTree[i].rchild=-1;
}
for(i=0;i<n;i++)
{
cout<<"请输入第"<<i+1<<"个权值"<<endl;
cin>>HFMTree[i].weight;
cout<<"请输入对应字符"<<endl;
cin>>HFMTree[i].hfmstr;
}
for(i=0;i<n-1;i++)
{
x1=x2=MAXVALUE;
m1=m2=0;
for(j=0;j<n+i;j++)
{
if(HFMTree[j].parent==-1&&
共 页 第 页
HFMTree[j].weight<x1)
{
x2=x1;
m2=m1;
x1=HFMTree[j].weight;
m1=j;
}
else if(HFMTree[j].parent==-1&&HFMTree[j].weight<x2)
{
x2=HFMTree[j].weight;
m2=j;
}
}
HFMTree[m1].parent=n+i;
HFMTree[m2].parent=n+i;
HFMTree[n+i].weight=HFMTree[m1].weight+HFMTree[m2].weight;
HFMTree[n+i].lchild=m1;
HFMTree[n+i].rchild=m2;
}
cout<<"创立哈夫曼树成功！"<<endl;
共 页 第 页
}
void HaffmanCode(HNodeType HFMTree[],HCodeType HuffCode[],int n) /*构建哈夫曼编码*/
{
HCodeType cd;
int i,j,c,p;
for(i=0;i<n;i++)
{
=n-1;
c=i;
p=HFMTree[c].parent;
while(p!=-1)
{
if(HFMTree[p].lchild==c)
[]=0;
else
[]=1;
--;
c=p;
p=HFMTree[c].parent;
}
for(j=+1;j<n;j++)
HuffCode[i].bit[j] = [j];
共 页 第 页
HuffCode[i].start = ;
}
}
void decodeing(char string[],HNodeType HFMTree[],int