静态存储哈弗曼.docVIP

#includestdio.h #includestdlib.h #includestring.h typedef struct { int weight; int parent,lchild,rchild; }HTnode,*Huffmantree; typedef char **Huffmancode; void select(Huffmantree HT,int k,int *s1,int *s2) { //赫夫曼树HT中选paren为0且权值最小的两结点，s1，s2 int i,j=1,min,e; while(HT[j].parent !=0) j++; if(jk) {printf(无空闲结点！\n);exit(0);} else min=HT[j].weight ; for(i=1;i=k;i++) if((HT[i].weight min)(HT[i].parent ==0)) { j=i;min=HT[i].weight ;} e=*s1=j;j=1; while(HT[j].parent !=0||j==*s1) j++; if(jk) {printf(无空闲结点 ！\n);exit(0);} else min=HT[j].weight ; for(i=1;i=k;i++) if((HT[i].weight min)(HT[i].parent ==0)(i!=e)) { j=i;min=HT[i].weight ;} *s2=j; } void Huffmancoding(Huffmantree *HT,Huffmancode *HC,int w[],int n) { int i,m,c,s1,s2,start,f; //char * cd; Huffmantree p; if(n=1) {printf(无法构成树！\n);exit(0);} m=2*n-1; *HT=(Huffmantree)malloc((m+1)*sizeof(HTnode)); //0号单元未用 for(p=*HT+1,i=1;i=n;i++,++p ) { (*p).weight =w[i]; printf(HT[%d].weight=%d\n,i,(*p).weight ); (*p).lchild =0; (*p).parent =0; (*p).rchild =0; } for(;i=m;i++,++p) { (*p).weight =0; (*p).lchild =0; (*p).parent =0; (*p).rchild =0; } for(i=n+1;i=m;++i) { select(*HT,i-1,s1,s2); (*HT)[s1].parent =i; (*HT)[s2].parent =i; (*HT)[i].lchild =s1; (*HT)[i].rchild =s2; (*HT)[i].weight =(*HT)[s1].weight+(*HT)[s2].weight; printf(HT[%d] and HT[%d] -- HT[%d].weight\n,s1,s2,i,(*HT)[i].weight); } *HC=(Huffmancode)malloc((n+1)*sizeof(char *)); char *cd; cd=(char *)malloc(n*sizeof(char)); cd[n-1]=\0; printf(HuffmanTree Code is as follows :); for(i=1;i=n;++i) { start=n-1; for(c=i,f=(*HT)[i].parent;f!=0;c=f,f=(*HT)[f].parent) if((*HT)[f].lchild==c) cd[--start]=0; else cd[--start]=1; (*HC)[i]=(char*)malloc((n-start)*sizeof(char)); strcpy((*HC)[i],cd[start]); printf(\