大数据结构哈夫曼编译码器

wordword#/24{cout<<code[j].bits[k];huffmancode[n]=code[j].bits[k];n++;}}}voidtranscodehuffman(hufcodecode[],huftreetree[],chars[]) //哈夫曼译码{inti;char*q=NULL;i=hufnum-1;q=s;while(*q!='\0'){if(*q=='0')i=tree[i].lchild;迁(*q==T)i=tree[i].rchild;if((tree[i].lchild=O)&&(tree[i].rchild=O)){cout<<code[i].ch;i=hufnum-1;}q++;

cout<<endl;//输出哈夫曼树voidprinttreehuffman(huftreetree[])//输出哈夫曼树cout<<”根据字符的使用概率所建立的哈夫曼数为:"vvendl;cout<<”字符序号字符名称字符频率双亲位置左孩子右孩子"<<endl;for(i=1;i<hufnum;i++)cout<<" "<<i<<"\t"<<tree[i].name<<"\t";cout<<tree[i].weight<<"\t"<<tree[i].rchild<<endl;!!<<tree[i].parent<<"\t"<<tree[i].lchild<<"〃输出每个字符的哈夫曼voidprintcodehuffman(hufcodecode[])〃输出每个字符的哈夫曼编码inti,j;cout<<”根据哈夫曼树对字符所建立的哈夫曼编码为:!!<<endl;cout<<”字符序号字符名称 字符编码”<<endl;for(i=1;i<=leafnum;i++)cout<<" "<<i<<"\t "<<code[i].ch<<"for(j=code[i].start;j<leafnum;j++)cout<<code[i].bits[j];cout<<"\t\t"<<endl;}}voidmain(){creattreehuffman(tree);printtreehuffman(tree);creatcodehuffman(code,tree);printcodehuffman(code);writecodehuffman(code,tree);char*filename="e:\\codefile.txt";ofstreamofs(filename);ofs<<huffmancode;ofs.close();ifstreamifs(filename);if(!ifs){cout<<"Error:failedtoopenfile."<<endl;exit(0);}charbuffer[1000];ifs>>buffer;cout<<endl<<endl;cout<<"codefile文件中的代码如下:"<<endl;cout<<buffer<<endl<<endl;ifs.close()