静态存储哈弗曼.doc

#include#include#includetypedef 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(HTj.parent !=0) j+; if(jk) printf(无空闲结点！n);exit(0); else min=HTj.weight ; for(i=1;i=k;i+) if(HTi.weight k) printf(无空闲结点 ！n);exit(0); else min=HTj.weight ; for(i=1;i=k;i+) if(HTi.weight min)&(HTi.parent =0)&(i!=e) j=i;min=HTi.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 =wi;printf(HT%d.weight=%dn,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 HT%d.weightn,s1,s2,i,(*HT)i.weight); *HC=(Huffmancode)malloc(n+1)*sizeof(char *); char *cd; cd=(char *)malloc(n*sizeof(char); cdn-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,&cdstart); printf(nHT%d.weight=%d nodes Huffman code is: %s,i,(*HT)i.weight,(*HC)i); free(cd);printf( n);void main() Huffmantree HT; Huffmancode HC;int w20,i,n;w0=0; printf(n 静态存储方式n输入编码个数n=);scanf(%d,&