1、#include<stdio.h>#include<stdlib.h>#define n 4#define m 2*n-1#define maxval 32769typedef structfloat weight;int lchild,rchild,parent; char ch;huftree;typedef structchar bitsn;int start;codetype;codetype coden;huftree treem;void hufman(huftree tree)/創建哈夫曼樹 int i,j,p1,p2; char ch; float sm

2、all1,small2,f; for(i=0;i<m;i+)/初始化所有結點 treei.parent=0; treei.lchild=0; treei.rchild=0; treei.weight=0.0; printf("請輸入結點的權值：n"); for(i=0;i<n;i+)/輸入n個結點的權值 scanf("%f",&f);treei.weight=f; printf("請輸入結點的字符：n");scanf("%c",&ch); for(i=0;i<n;i+)/輸入n個結

3、點的權值 scanf("%c",&ch);treei.ch=ch; for(i=n;i<m;i+)/進行n-1次合并，產生n-1個新結點 p1=0,p2=0;small1=maxval;small2=maxval;for(j=0;j<=i-1;j+)/找出權值最小的兩個根結點if(treej.parent=0)if(treej.weight<small1)/改變最小權與次小權的位置small2=small1;small1=treej.weight;p2=p1;p1=j;/鎖定最小權的位置 elseif(treej.weight<small2)

4、small2=treej.weight;p2=j;/鎖定次小權的位置treep1.parent=i+1;/生成的新結點為最小權與次小權的雙親treep2.parent=i+1;treei.lchild=p1+1;treei.rchild=p2+1;treei.weight=treep1.weight+treep2.weight; void creathufcode(codetype code)/由哈夫曼數構建哈夫曼編碼 int i,c,p; codetype cd; for(i=0;i<n;i+) cd.start=n; c=i+1; p=treei.parent; while(p!=0

5、) cd.start-; if(treep-1.lchild=c) cd.bitscd.start='0' else cd.bitscd.start='1' c=p; p=treep-1.parent; codei=cd; void decode(codetype code,huftree tree)/依次讀入電文，根據哈夫曼樹譯碼 int i,b; int flag=-1; i=m-1; printf("請輸入電文編碼："); scanf("%d",&b); while(b!=flag) if(b=0) i=treei.lchild-1; else i=treei.rchild-1; if(treei.lchild=0)/找到葉節點，輸出對應字符 printf("譯碼后對應的字符:%cn",treei.ch); printf("譯碼后字符對應的權值:%f",treei.weight); i=m-1; scanf("%d",&b); if(treei.lchild!=0) print