哈夫曼树的编码与译码

1、#include<stdio.h>#include<stdlib.h>#define n 4#define m 2*n-1#define maxval 32769typedef structfloat weight;int lchild,rchild,parent; char ch;huftree;typedef structchar bitsn;int start;codetype;codetype coden;huftree treem;void hufman(huftree tree)/创建哈夫曼树 int i,j,p1,p2; char ch; float sm

2、all1,small2,f; for(i=0;i<m;i+)/初始化所有结点 treei.parent=0; treei.lchild=0; treei.rchild=0; treei.weight=0.0; printf("请输入结点的权值：n"); for(i=0;i<n;i+)/输入n个结点的权值 scanf("%f",&f);treei.weight=f; printf("请输入结点的字符：n");scanf("%c",&ch); for(i=0;i<n;i+)/输入n个结

3、点的权值 scanf("%c",&ch);treei.ch=ch; for(i=n;i<m;i+)/进行n-1次合并，产生n-1个新结点 p1=0,p2=0;small1=maxval;small2=maxval;for(j=0;j<=i-1;j+)/找出权值最小的两个根结点if(treej.parent=0)if(treej.weight<small1)/改变最小权与次小权的位置small2=small1;small1=treej.weight;p2=p1;p1=j;/锁定最小权的位置 elseif(treej.weight<small2)

4、small2=treej.weight;p2=j;/锁定次小权的位置treep1.parent=i+1;/生成的新结点为最小权与次小权的双亲treep2.parent=i+1;treei.lchild=p1+1;treei.rchild=p2+1;treei.weight=treep1.weight+treep2.weight; void creathufcode(codetype code)/由哈夫曼数构建哈夫曼编码 int i,c,p; codetype cd; for(i=0;i<n;i+) cd.start=n; c=i+1; p=treei.parent; while(p!=0

5、) cd.start-; if(treep-1.lchild=c) cd.bitscd.start='0' else cd.bitscd.start='1' c=p; p=treep-1.parent; codei=cd; void decode(codetype code,huftree tree)/依次读入电文，根据哈夫曼树译码 int i,b; int flag=-1; i=m-1; printf("请输入电文编码："); scanf("%d",&b); while(b!=flag) if(b=0) i=treei.lchild-1; else i=treei.rchild-1; if(treei.lchild=0)/找到叶节点，输出对应字符 printf("译码后对应的字符:%cn",treei.ch); printf("译码后字符对应的权值:%f",treei.weight); i=m-1; scanf("%d",&b); if(treei.lchild!=0) print