哈夫曼编码程序.docVIP

#include stdio.h typedef struct{ float weight; int parent,lchild,rchild; }huftree; typedef struct{ int bit[100]; int length; }hufcode; huftree tree[100];//哈夫曼树 hufcode code[100];//编码 int num,m;//个数，编码最大长度 void HufBuild() { int i,j,p1,p2; float s1,s2; printf(How: ); scanf(%d,num); m=2*num-1; printf(请输入各个编码频率: ); for(i=0;inum;i++) { scanf(%f,tree[i].weight); tree[i+num].parent=tree[i].parent=0; tree[i+num].lchild=tree[i].lchild=0; tree[i+num].rchild=tree[i].rchild=0; } for(i=num;im;i++) { s1=s2=1; p1=p2=0; for(j=0;ji;j++) if(tree[j].parent==0) if(