C语言实现哈夫曼编码(共3页).doc

/*先根据位权构造一颗哈夫曼树，测试数据 0.05 0.1 0.15 0.2 0.25 0.25，再从叶子结点到根结点编码。程序结果保存在out.dat中。*/#include#include#include#define N 6typedef struct double weight;int parent,lchild,rchild;HuffmanTree;void Select(HuffmanTree *HT,int i,int *s1,int *s2)int n,T=0,T1;for(n=1;ni;n+)if(HTn.weight=HTT.weight)&HTn.parent=0)T=n;*s1=T;T1=T;T=0;for(n=1;ni;n+)if(n=T1)continue;if(HTn.weight=HTT.weight