1、 Huffman編碼及實現實驗目的：掌握Huffman編碼的算法及其實現。實驗環境：Windows XP VC+6.0實驗結果：please input the number of Tree Nodes5please input the weights0.10.40.20.050.25源程序：#include using namespace std;#include typedef struct float weight;unsigned int parent, lchild,rchild;HTNode, *HuffmanTree;typedef char* HuffmanCode;void

2、Select(HuffmanTree HT, int n, int &s1, int &s2)float smallest1=1000,smallest2=1000;int i;for(i = 1; i = n ; i+) if(HTi.weight smallest1 & HTi.parent = 0 )smallest1 = HTi.weight;s1 = i;for(i =1; i = n ; i+)if (HTi.weight smallest2 )if( i!= s1 & HTi.parent = 0 )smallest2 = HTi.weight;s2 = i; void Huff

3、manCoding(HuffmanTree HT, HuffmanCode HC,float *w,int n)HTNode *p;int m;int i;int s1,s2;int start;int c,f;if(n = 1 ) return;m = 2*n-1;HT = new HTNode m+1;for( i = 1; i = n; +i) HTi.weight = wi;HTi.parent = HTi.lchild = HTi.rchild = 0; for( ; i =m; +i,+p)HTi.weight = 0;HTi.parent = HTi.lchild = HTi.r

4、child = 0;for(i = n+1; i=m; i+) Select(HT,i-1,s1,s2);HTs1.parent = i; HTs2.parent = i;HTi.lchild = s1;HTi.rchild = s2;HTi.weight = HTs1.weight+HTs2.weight; coutThe HuffmanCode of the Data are:endl;HC = new char* n+1;char * cd = new char n;cdn-1 = 0;for( i = 1; i = n; i+) start = n-1;for(c = i, f = HTi.parent; f!= 0; c = f, f = HTf.parent)if(HTf.lchild = c) cd-start = 0;else cd-start = 1;HCi=new char n-start; strcpy(HCi,&cdstart);coutHTi.weight HCiendl; delete cd;int main()int i;int n;float *w;HuffmanTree HT;HuffmanCode HC;w = new float n+1;coutpl