赫夫曼树编程.doc

赫夫曼树编程 #includestdio.h #includemalloc.h typedef struct { int weight; int parent; int lChild; int rChild; }HINode,HuffmanTree; void Select(HuffmanTree *ht,int index,int *p1,int *p2); void CreateHuffmanTree(HuffmanTree **HT,int *w,int n); void HuffmanCoding(HuffmanTree *ht,int n); void printfHuffmanTree(HuffmanTree *ht,int n); int main() { int weight[]={5,29,7,8,14,23,3,11}; int n=8; int i; HuffmanTree *ht; printf(一共有%d个字符的权重值，分别为： \n,n); for(i=0;in;i++) printf(%d\n,weight[i]); CreateHuffmanTree(ht,weight,n); printf(\n生成的赫夫曼树结构如下： \n); printfHuffmanTree(ht,n); HuffmanCoding(ht,n); } void Select(HuffmanTree *ht,int index,int *p1,int *p2) { int i,minIndex1,minIndex2,minWeight1,minWeight2; if(index2) {printf(select函数中参数出错了!); return;} minIndex1=minIndex2=-1; for(i=1;i=index;i++) if(ht[i].parent==0) { if(minIndex10){minIndex1=i; minWeight1=ht[i].weight; continue;} if(ht[i].weightminWeight1) { minIndex2=minIndex1; minWeight2=minWeight1; minIndex1=i; minWeight1=ht[i].weight; } else if((minIndex20 ht[i].weightminWeight2)|| minIndex20) { minIndex2=i; minWeight2=ht[i].weight;} } *p1=minIndex1; *p2=minIndex2; } void CreateHuffmanTree(HuffmanTree **HT,int *w,int n) { int m,i,s1,s2; HINode *p; if(n=1) return; m=2*n-1; *HT=(HuffmanTree *)malloc((m+1)*sizeof(HINode)); for(p= *HT+1,i=1;i=n;++i,++p,++w) { p-weight=*w; p-rChild=0; p-parent=0; p-weight=0; } printf(\n赫夫曼树结构初始化如下：\n); printfHuffmanTree(*HT,n); p=*HT; for(i=n+1;i=n;++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; } } void HuffmanCoding(HuffmanTree *ht,int n) { int i,start,c,f,j; char *cd=(char *)malloc(n*sizeof(char)); cd[n-1]=\0; printf(各个字符(权重值)对应的编码为：(注：编码并不是唯一的) \n); printf(index weight code); 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; printf(\n%-5d %-6d,i,ht[i].weight); for(j=start;jn-1;j++) printf(%c,cd[j]); } } void prin