赫夫曼树编码.docVIP

#include stdio.h #include stdlib.h #define MaxSize 50 typedef struct{ char c; //代码; int w; //代码权值; char code[MaxSize]; //代码的Huffman编码; }HuffCode[MaxSize]; typedef struct{ int Weight; //权值; int LChild,RChild,Parent; }HTNode,HuffTree[MaxSize]; //================================================================================ void HuffmanTree(HuffTree HT,int length,HuffCode hc); //生成Huffman树; void SelectHTNode(HuffTree HT,int n,int *min1,int *min2); //查找最小和次小序号; void HuffmanCode(HuffTree HT,int len,HuffCode hc); //生成Huffman编码; //================================================================================ int main(void) { HuffTree HT; //Huffman树; HuffCode HC; //Huffman编码; int i,len; printf(\n输入代码数量：); scanf(%d,len); system(cls);printf(代码数量：%2d\n\n,len); printf(输入代码及权值(e.g.: \a16[回车]\ )：\n); for(i=1;i = len;i++) { while(getchar() != \n) NULL; printf(No.%2d： ,i); HC[i].c = getchar(); scanf(%d,HC[i].w); } HuffmanTree(HT,len,HC); HuffmanCode(HT,len,HC); printf(\n输出Huffman编码：\n); for(i = 1;i=len;i++) { printf(\n %c :,HC[i].c); puts(HC[i].code); } //测试Huffman树结构; printf(\n\n输出Huffman树结构：);system(pause); printf(\nHT[i]:\t权值\t双亲\t左孩子\t右孩子\n); for(i = 1;i2*len;i++) { if(i = len) printf((%c),HC[i].c); printf(%2d:\t %2d;\t%2d,\t %2d,\t %2d.\n, i,HT[i].Weight,HT[i].Parent,HT[i].LChild,HT[i].RChild); } return 0; } //================================================================================ void HuffmanTree(HuffTree HT,int length,HuffCode hc) //Huffman树初始化; { int i,min1,min2; HT[0].Weight = 65535; for(i = 1;i = length;i++) { HT[i].Weight = hc[i].w; HT[i].LChild = HT[i].RChild = HT[i].Pa