c语言构建哈夫曼树(附运行结果图)(共4页).docx

精选优质文档-倾情为你奉上#include #include #include int m,s1,s2; typedef struct unsigned int weight; unsigned int parent,lchild,rchild; HTNode,*HuffmanTree; /动态分配数组存储哈夫曼树 typedef char *HuffmanCode; /动态分配数组存储哈夫曼编码表 void Select(HuffmanTree HT,int n) int i,j; for(i = 1;i = n;i+) if(!HTi.parent)s1 = i;break; for(j = i+1;j = n;j+) if(!HTj.parent)s2 = j;break; for(i = 1;i HTi.weight)&(!HTi.