1、HTNode,*HuffmanTree;typedef struct LNode char *elem; int stacksize; int top;SqStack;在main函数里面定义一个哈弗曼树并实现上述各种功能。程序结构的描述:本次实验一共构造了10个函数:1.void HuffTree(HuffmanTree &HT,int n,int mun);此函数根据给定的mun个权值构建哈弗曼树,n用于存放num个权值。 2.void Select(HuffmanTree &HT,int n,int i,int &s1,int &s2);此函数用于在HT1,i-1中选择parent为0且w
2、eight为最小的两个结点,其 下标分别为s1,s2.3.void HuffmanCoding(HuffmanTree HT,char *&HC,int n);此函数从哈弗曼树HT上求得n 个叶子结点的哈弗曼编码并存入数组HC中。4.void Coding(HuffmanTree HT,char *HC,int root,SqStack &S);此函数用于哈弗曼编码,先序遍历哈弗曼树HT,求得每个叶子结点的编码字符串,存入数组HC,S为一个顺序栈,用来记录遍历路径,root是哈弗曼数组HT中根结点的位置下标。5.void InitStack(SqStack &S);此函数用于初始化一个栈。6.
3、void Pop(SqStack &S,char e);此函数为出栈操作。7.void Push(SqStack &此函数为进栈操作。8.int StackLength(SqStack S);此函数用于求栈长,返回一个int型的值。9.int Find(char a,char s,int num);此函数用于查找字符a在电文串中的位置。10.int Recover(HuffmanTree HT,char *HC,char string,char a,char b,int n);此函数用于将比特流还原成电文。调试分析: 输入任意一个字符串,如输入welcometoustc:运行结果如下:按照提示
4、输入任意一个或多个哈弗曼编码,如输入11111110101:结果正确。若输入一个11111:实验完成!实验体会和收获:本次实验提高了对哈弗曼树的认识,同时加深了对二叉树的理解,在栈的运用上更加熟练,对数组的应用也有了提高。源代码:#includestdlib.hmalloc.hstring.h#define size 20void HuffTree(HuffmanTree &void Select(HuffmanTree &void HuffmanCoding(HuffmanTree HT,char *&void Coding(HuffmanTree HT,char *HC,int root,
5、SqStack &void InitStack(SqStack &void Pop(SqStack &void Push(SqStack &int StackLength(SqStack S);int Find(char a,char s,int num);int Recover(HuffmanTree HT,char *HC,char string,char a,char b,int n);int main() int i=0,nsize=0,j=0,k=1,num=0; char stringsize=0,msize=0,asize=0,bsize=0; char* HC; Huffman
6、Tree HT; printf(请输入电文串:n); scanf(%s,string); strcpy(m,string); while(stringj) if(stringj!=#) ak=stringj; i=j; while(stringi) if(stringi=ak) stringi=; nk+; i+; if(nk!=0) printf(该电文中字符%c出现次数为%dn,ak,nk); num+; k+; j+; 哈弗曼树: HuffTree(HT,n,num); for(i=1;i=2*num-1;i+) printf(%dt%dt%dt%dn,HTi.weight,HTi.pa
7、rent,HTi.lc,HTi.rc);哈弗曼编码: HuffmanCoding(HT,HC,num);=num;i+)%c : %sn,ai,HCi);n该电文的哈弗曼编码为: i=0; while(stringi),HCFind(mi+,a,num);n请输入哈弗曼编码: if(Recover(HT,HC,string,a,b,num) printf(%sn,b); else printf(代码有误! system(pause return 0;HT,int n,int num) int i,m,s1,s2; m=2*num-1; HT=(HuffmanTree)malloc(m+1)*s
8、izeof(HTNode);=m; HTi.weight=i=num?ni:0; HTi.lc=HTi.rc=HTi.parent=0; for(i=num+1; Select(HT,num,i,s1,s2); HTi.lc=s1; HTi.rc=s2; HTi.weight=HTs1.weight+HTs2.weight; HTs1.parent=HTs2.parent=i;s2) int k,t; s1=s2=-1; k=1; while(s1=-1) if(HTk.parent=0) s1=k; k+; while(s2=-1|s2=s1) s2=k; if(HTs2.weightHTs
9、1.weight) t=s2;s2=s1;s1=t; for(k=1;ki;k+) if(HTk.weightHTs1.weight&k!=s1&=s2) s2=s1; s1=k; else if(HTk.weight=HTs1.weight&=s2) s2=k;HC,int n) SqStack S; InitStack(S); HC=(char*)malloc(n+1)*sizeof(char*); Coding(HT,HC,2*n-1,S);S) if(root!=0) if(HTroot.lc=0) Push(S,0 HCroot=(char*)malloc(StackLength(S
10、); strcpy(HCroot,S.elem); Pop(S, Push(S,0 Coding(HT,HC,HTroot.lc,S); Pop(S,1 Coding(HT,HC,HTroot.rc,S); S.elem=(char *)malloc(size*sizeof(char); S.stacksize=size; S.top=-1;S,char e) S.elem+S.top=e; if(S.top=-1) return; e=S.elemS.top-; return;int StackLength(SqStack S) if(S.top=-1) return(0); return(
11、S.top);int Find(char a,char s,int num) int i; if(a=si) return i;int Recover(HuffmanTree HT,char *HC,char string,char a,char b,int n) int i=0,j=0,k,m=0,t=0,h=0; char ssize; k=2*n-1; if(!HTk.lc&!HTk.rc) if(stringi=) sj=k=2*n-1;t=1;j=0;) sj= k=2*n-1; t=1; j=0; for(h=1;h=n;h+) if(!strcmp(HCh,s) bm+=ah; else) k=HTk.lc;sj+= if(stringi= k=HTk.rc; sj= j+; t=0;t) i+; if(! if(stringi-1= bm= if(k=2*n-1) return 1; else return 0;THANKS !致力为企业和个人提供合同协议,策划案计划书,学习课件等等打造全网一站式需求欢迎您的下载,资料仅供参考
copyright@ 2008-2022 冰豆网网站版权所有
经营许可证编号:鄂ICP备2022015515号-1