哈夫曼树的相关操作.docVIP

/*哈夫曼树的建立,编码及译码*/ #includestdio.h #define n 5 #define m 2*n-1 typedef int datatype; typedef struct { int weight; int lchild,rchild,parent; }hufmtree; typedef struct { char bits[n]; int start; char ch; }codetype; /*建立*/ hufmtree tree[m]; huffman(tree) hufmtree tree[]; { int i,j,p1,p2; int small1,small2,f; for(i=0;im;i++) { tree[i].parent=0; tree[i].lchild=0; tree[i].rchild=0; tree[i].weight=0.0; } for(i=0;in;i++) { scanf(%d,f); tree[i].weight=f; } for(i=n;im;i++) { p1=0; p2=0; small1=1000; small2=1000; for(j=0;j=i-1;j++) if (tree[j].parent==0) if(tree[j].weightsmall1) { small2=small1; small1=tree[j].weight; p2=p1; p1=j; } else if (tree[j].weightsmall2) { small2=tree[j].weight; p2=j; } tree[p1].parent=i+1; tree[p2].parent=i+1; tree[i].lchild=p1+1; tree[i].rchild=p2+1; tree[i].weight=tree[p1].weight+tree[p2].weight; } printf(********************************************************************************); printf(\tNo\tweight\tparent\tlchild\trchild\n); printf(********************************************************************************); for(i=0;im;i++) { printf(\t%d\t,i); printf(%d\t,tree[i].weight); printf(%d\t,tree[i].parent); printf(%d\t,tree[i].lchild); printf(%d\n,tree[i].rchild); } printf(********************************************************************************); } /*编码*/ codetype code[n]; huffmancode(code,tree) codetype code[]; hufmtree tree[]; { int i,j,c,p; codetype cd; getchar(); for(i=0;in;i++) { cd.start=n; sca