Huffman根據(jù)給定的n個權(quán)值{w1，w2，…，wn}構(gòu)造n棵二叉樹的集合F={T1，T2，…，Tn}，其中每棵二叉樹Ti中只有一個帶權(quán)為wi的根結(jié)點，其左、右均為空。二叉樹的根結(jié)點權(quán)值為其左、右根結(jié)點的權(quán)值之和。F（2（具體在實現(xiàn)Huffman算法時，可以采用有序鏈表存放集合F中各根結(jié)點的權(quán)值。以后每循環(huán)一次就在鏈表的表頭取下連續(xù)兩棵即為最小和次最小權(quán)值的二叉）作為左Huffman樹。（//Huffman算法#include<iostream>usingnamespacestd;#defineMAX99charcha[MAX];charhc[MAX-ints1,s2;設(shè)置全局變量，以便在方法(函數(shù))select typedefstruct//huffman樹結(jié){unsignedintwei;intvoidselect(hufftreetree[],intk)找尋parent0,{intfor(i=1;i<=k&&tree[i].parent!=0;i++);s1=i;for(i=1;i<=k;i++)if(tree[i].parent==0&&tree[i].wei<tree[s1].wei)s1=i;for(i=1;i<=k;i++)if(tree[i].parent==0&&i!=s1)break;s2=i;for(i=1;i<=k;i++)if(tree[i].parent==0&&i!=s1&&tree[i].wei<tree[s2].wei)}voidhuffman(hufftreetree[],int*w,intn)huffman{intif(n<=1)return;for }for }for select(tree,i-1);tree[i].wei=tree[s1].wei+}}voidhuffmancode(hufftreetree[],charcode[],int{intcout"Huffman編碼<<endl; }

cout<<cha[i]<<"-->"<<hc[i]}}voidtohuffmancode(int intcharcout請輸入一段字符endl;cin>>anychar;coutHuffman編碼后的結(jié)果為endl;for(;anychar[i]!='\0';i++) if}

coutcout}voiddecode(charch[],hufftreetree[],int{inti,j,m;charb;cout<<"請輸入你要的編碼:"<<endl;cin>>b;cout<<"結(jié)果為:"<<endl; { cout<<ch[i];}cin}cout發(fā)生錯誤}void{intint*w,wei[MAX];charcode[MAX];hufftreetree[MAX];coutn(n為你要建樹的字符個數(shù)endl;cin>>n;cout請輸入字符和它的權(quán)值(例如:a20):"endl; cin>>cha[i]/