赫夫曼树的编码译码.docVIP

#includestdio.h #includestdlib.h #includestring.h typedef struct{ int weight; int lchild,rchild,parent; }Htnode,*HuffmanTree; //哈弗曼树节点类型，动态分配数组存储哈弗曼树 typedef char * * Huffmancode; //动态分配数组存储哈弗曼编码表 void bianma(Huffmancode ch,int n); //编码 void yima(Htnode *HT, int n); //译码 int createtree(Htnode *HT, Huffmancode HC,int *weight,int n); //构建哈弗曼树 void select(Htnode *HT,int n,int *s1,int *s2); //求节点中两个最小数 /*----------main 函数----------*/ int main (void) { Htnode *HT; int n=4,a; //叶子节点4个 int weight[5]={18,7,5,2,4}; //weight[0]为权值之和 char ch[4]={A,B,C,D},c; char **HC; createtr