哈夫曼树和编码应用用C++实现

2025-04-07 06:16:32

推荐回答（2个）

回答（1）：

#include

#define
MAXBIT
10
/*定义哈夫曼编码的最大长度*/
#define
MAXVALUE
10000
/*定义最大权值*/
#define
MAXLEAF
30
/*定义哈夫曼树中最多叶子节点个数*/
#define
MAXNODE
MAXLEAF*2-1
/*哈夫曼树最多结点数*/
typedef
struct
{
/*哈夫曼编码信息的结构*/
int
bit[MAXBIT];
int
start;}Hcodetype;
typedef
struct
{
/*哈夫曼树结点的结构*/
int
weight;
int
parent;
int
lchild;
int
rchild;
}Hnodetype;
void
huffmantree(Hnodetype
huffnode[MAXNODE],int
n)
/*构造哈夫曼树的函数*/
{
int
i,j,m1,m2,x1,x2;
for(i=0;i<2*n-1;i++)
/*存放哈夫曼树结点的数组huffnode[]初始化*/
{
huffnode[i].weight=0;
huffnode[i].parent=-1;
huffnode[i].lchild=-1;
huffnode[i].rchild=-1;
}
for(i=0;i/*输入入N个叶子节点的权值*/
{
printf("please
input
%d
character's
weight\n",i);
scanf("%d",&huffnode[i].weight);
}
for(i=0;i/*开始循环构造哈夫曼树*/
{
m1=m2=MAXVALUE;
x1=x2=0;
for(j=0;j{
if(huffnode[j].weight{
m2=m1;x2=x1;m1=huffnode[j].weight;x1=j;
}
else
if(huffnode[j].weight{
m2=huffnode[j].weight;x2=j;
}
}
huffnode[x1].parent=n+i;
huffnode[x2].parent=n+i;
huffnode[n+i].weight=huffnode[x1].weight+huffnode[x2].weight;
huffnode[n+i].lchild=x1;
huffnode[n+i].rchild=x2;
}
}
void
main()
{
Hnodetype
huffnode[MAXNODE];
Hcodetype
huffcode[MAXLEAF],cd;
int
i,j,c,p,n;
printf("please
input
n\n");
scanf("%d",&n);
/*输入叶子节点个数*/
huffmantree(huffnode,n);
/*建立哈夫曼树*/
for(i=0;i/*该循环求每个叶子节点对应字符的哈夫曼编码*/
{
cd.start=n-1;c=i;
p=huffnode[c].parent;
while(p!=-1)
{
if(huffnode[p].lchild==c)
cd.bit[cd.start]=0;
else
cd.bit[cd.start]=1;
cd.start--;c=p;
p=huffnode[c].parent;
}
for(j=cd.start+1;j/*保存求出的每个叶节点的哈夫曼编码和编码的起始位*/
huffcode[i].bit[j]=cd.bit[j];
huffcode[i].start=cd.start;
}
for(i=0;i/*输出每个叶子节点的哈夫曼编码*/
{
printf("%d
character
is:",i);
for(j=huffcode[i].start+1;jprintf("%d",huffcode[i].bit[j]);
printf("\n");
}
}

回答（2）：

#include
#define MAXBIT 10 /*定义哈夫曼编码的最大长度*/
#define MAXVALUE 10000 /*定义最大权值*/
#define MAXLEAF 30 /*定义哈夫曼树中最多叶子节点个数*/
#define MAXNODE MAXLEAF*2-1 /*哈夫曼树最多结点数*/
typedef struct
{ /*哈夫曼编码信息的结构*/
int bit[MAXBIT];
int start;}Hcodetype;
typedef struct
{ /*哈夫曼树结点的结构*/
int weight;
int parent;
int lchild;
int rchild;
}Hnodetype;
void huffmantree(Hnodetype huffnode[MAXNODE],int n) /*构造哈夫曼树的函数*/
{
int i,j,m1,m2,x1,x2;
for(i=0;i<2*n-1;i++) /*存放哈夫曼树结点的数组huffnode[]初始化*/
{
huffnode[i].weight=0;
huffnode[i].parent=-1;
huffnode[i].lchild=-1;
huffnode[i].rchild=-1;
}
for(i=0;i {
printf("please input %d character's weight\n",i);
scanf("%d",&huffnode[i].weight);
}
for(i=0;i {
m1=m2=MAXVALUE;
x1=x2=0;
for(j=0;j {
if(huffnode[j].weight {
m2=m1;x2=x1;m1=huffnode[j].weight;x1=j;
}
else if(huffnode[j].weight {
m2=huffnode[j].weight;x2=j;
}
}
huffnode[x1].parent=n+i;
huffnode[x2].parent=n+i;
huffnode[n+i].weight=huffnode[x1].weight+huffnode[x2].weight;
huffnode[n+i].lchild=x1;
huffnode[n+i].rchild=x2;
}
}
void main()
{
Hnodetype huffnode[MAXNODE];
Hcodetype huffcode[MAXLEAF],cd;
int i,j,c,p,n;
printf("please input n\n");
scanf("%d",&n); /*输入叶子节点个数*/
huffmantree(huffnode,n); /*建立哈夫曼树*/
for(i=0;i {
cd.start=n-1;c=i;
p=huffnode[c].parent;
while(p!=-1)
{
if(huffnode[p].lchild==c) cd.bit[cd.start]=0;
else cd.bit[cd.start]=1;
cd.start--;c=p;
p=huffnode[c].parent;
}
for(j=cd.start+1;j huffcode[i].bit[j]=cd.bit[j];
huffcode[i].start=cd.start;
}
for(i=0;i {
printf("%d character is:",i);
for(j=huffcode[i].start+1;j printf("%d",huffcode[i].bit[j]);
printf("\n");
}
}

最新问答

长江黄河面临的共同问题是

16款起亚k52.0l高配有运动版的吗

我想知道Linux云计算学习的前提条件有什么？

高手们说说骁龙820⼀810⼀805⼀801⼀800 性能差的多吗

y=3(x+2)由那些简单函数复合而成

强力磁铁、钕铁硼、除铁器、磁力架、磁选设备哪家做的好？

vivox7手机怎么能升3.1的系统

请问钉钉老师版能看到学生的打卡地址吗？

国家公务员考试录取后放弃会有何影响

陕西市区哪家精神障碍看的较好圣和医院好吗？