数据结构哈弗曼编码实验详解.doc

哈弗曼 编码及译码 #include iostream.h#include math.h#include stdlib.h#include string.h#define MAXSIZE 100 //最多子叶数#define MAXCODE 10000 //编码最大长度 typedef struct{ char info; //关联字符信息 unsigned int weight; //每个节点的权职 unsigned int parent, lchild, rchild;}HTNode,*HuffmanTree; typedef char **HuffmanCode; //存储哈弗曼编码 void Select(HuffmanTree HT, int j,int s1,int s2){//选择双亲节点为0，并且最小的两个子叶节点 int i=1,m; while(HT[i].parent!=0) i++; //找第一个双亲节点为0的子叶结点 for(s2=s1=i;ij;i++) {//保证s1中的权值最小，s2次小 if(HT[i].parent==0 HT[i].weightHT[s1].weight) { s2=s1; s1=i; } else if(HT[i].parent==0 HT[i].weight=HT[s1].weight HT[i].weight=HT[s2].weight) s2=i; while(HT[i].parent==0 s1==s2) { m=i; m++; while(HT[m].parent!=0) m++; s2=m; } }}void HuffmanCoding(HuffmanTree HT, HuffmanCode HC, int *w, int n, char *info){//哈弗曼编码 int i,m; HuffmanTree p; if(n1) return; m = 2*n-1; HT = (HuffmanTree)malloc((m+1)*sizeof(HTNode)); for(p=HT+1,i=1;i=n;++i,++p,++w,++info) {//初始化所有已存在的子叶信息 p-info = *info; p-weight = *w; p-parent = 0; p-lchild = 0; p-rchild = 0; }//for for(; i=m;++i,++p) {//构造所需要的过度根节点 p-weight = 0; p-parent = 0; p-lchild = 0; p-rchild = 0; }//for for(i=n+1;i=m;++i) {//建立哈弗曼树 int s1,s2; Select(HT,i-1,s1,s2); HT[s1].parent =i; HT[s2].parent =i; HT[i].lchild = s2; HT[i].rchild = s1; HT[i].weight = HT[s1].weight+HT[s2].weight; }//for //哈弗曼编码 HC = (HuffmanCode)malloc((n+1)*sizeof(char *)); char* cd = (char*)malloc(n*sizeof(char)); cd[n-1] = \0; for(i=1;i=n;++i) { int f; unsigned int c; int start=n-1; for(c=i,f=HT[i].parent;f!=0;c=f,f=HT[f].parent) { if(H