二叉樹的存儲與應(yīng)用

1、/link?url二VpxeyANa5bnKVPJAxF79YbXPSnnyZEwbHpQi zCA-3Id_aZGi7szmlnQ9FVlSt26VUsNBpLFCIpDfvSADJZHGP3NTh7E20d6DvlcICCBGQ e哈夫曼編碼/譯碼問題：已知某密碼中共含有5個字符A、B、C、D、E,它們出現(xiàn)的頻率依 次是0.1、0.3、0.4、0.15和0.05。要求采用哈夫曼算法，求出5個字符的最優(yōu)編碼；反之, 當(dāng)用戶給出某個0/1序列，解碼出相應(yīng)的字符序列；如有錯誤輸入的0/1序列，要打印出錯 提示信息。#in elude vstdio.h#i nclude vmalloc.h#in

2、elude vstri ng.hstruct huffmantreechar zifu;int weight;int pare nt,lchild,rchild;struct huffmancodechar cd50;int start;int *select(struct huffma ntree HT,i nt n ,i nt s)int i,mi n1,mi n2;min1 = 32767;min2 = 32767;for (i = 1; i = n; + i)if (HTi.weightvmi n1&H Ti.pare nt=0)mi n1 = HTi.weight; s0 = i;f

3、or (i = 1; i =min1&i != s0)mi n2 = HTi.weight;s1 = i;return s;void createhuffma ntree(struct huffma ntree HT,struct huffma ncode HC,char zi, int w,i nt n)FILE *fp;int m,i,s2,c,f,end=0,j,k;char lin shi50;if (nv=1) retur n;m=2* n-1;fp = fopen (hfmtree.txt,w+);for (i=1;iv=n;+i)HTi.zifu=zii;HTi.weight=w

4、i;HTi.pare nt=0;HTi.lchild=0;HTi.rchild=0;for (;iv=m;+i)HTi.weight=0;HTi.lchild=0;HTi.rchild=0;HTi.pare nt=0;for (i=n+1;iv=m;+i)select(HT,i-1,s);HTsO.pare nt = i;HTs1.pare nt = i;HTi.lchild = s0;HTi.rchild = s1;HTi.weight = HTsO.weight + HTs1.weight;for (i = 1;i = m; + i)fpri ntf(fp,%d %d%d%dn,i,HTi

5、.pare nt,HTi.lchild,HTi.rchild);for (i = 1;i = 0;j -,k +)HCi.cdk = lin shij;HCi.cdk = 0;end = 0;void pri nt(struct huffma ntree HT,struct huffma ncode HC,i nt n)int i,j;prin tf(輸出哈夫曼編碼:n);for (i = 1;i = n; i +)pri ntf(%c:,HTi.zifu);for (j = 0;j HCi.start;j +)pri ntf(%c,HCi.cdj);pri ntf(n);void pri n

6、thuffma ntree(struct huffma ntree HT,i nt n)int m,i;m = 2 * n - 1;pri ntf(char-pare nt-lchild-rchildn);for (i = 1;i = m; + i)prin tf(%d%d%d%dn,i,HTi.pare nt,HTi.lchild,HTi.rchild);int ma in()FILE *fp;int n,i,w100,xuanze,j,k=0,x,y=0,p=0,q;char zi100,a1000,huffma n1000,yiwe n1000;struct huffmancode HC

7、100;struct huffma ntree HT100;pri ntf*n 1.建立哈夫曼樹n 2.哈夫曼編碼n 3.哈夫曼譯碼n 4.打印哈夫曼樹 n 0退出n*門)；prin tf(輸入你想要的操作 n);sca nf (%d, &xua nze);while (xua nze)switch (xua nze)case 1:pri ntf(輸入需要字符的個數(shù) n);sca nf(%d,&n);prin tf(輸入需要字符的字符和權(quán)數(shù)n ”)；for (i = 1;i = n;+ i)getchar()();scanf (%c %d，&zii,&wi); createhuffma ntr

8、ee(HT,HC,zi,w, n); break;case 2:fp = fope n( ToBeTra n.txt,w+);pri ntf(輸入你想編碼的電文 n);getchar()();gets(a);fpri ntf(fp,%s,a);for (i = 0;ai != 0; +i)for (j = 1;j = n; +j)if (ai = HTj.zifu)for (x = 0;HCj.cdx != 0; +k,+ x)huffma nk=HCj.cdx;huffma nk = 0;prin tf(打印哈夫曼編碼n);for (i = 0;i 50; +i)for (j = 0;j =

9、 k)break;prin tf(n);if (p = k)break;fp = fope n( CodeFile.txt,w+);fpri ntf(fp,%s,huffma n);break;case 3:for (i = 0;huffmani != 0;)for (j = 1;j = n; +j)q = 0;for (p = 0;p HCj.start; +p)if (huffma ni = HCj.cdp)q +;i +;1)HTj.zifu;if(p = (HCj.start 1)HTj.zifu;yiwe ny=y +; break;elsei = i - q break;yiwe ny = 0; puts(yiwe n);prin tf(n);break;case 4:pri nthuffma ntree(HT, n);pri