哈夫曼树源代码.doc

.#include#include#includeusing namespace std;#define Max 200 /最大结点数目#define INT 10000char chMax; /叶子结点信息（字符）int i,wMax; /w为输入的权值数组typedef structunsigned int weight; /权值unsigned int parent,lchild,rchild;HTNode,*HuffmanTree; /动态分配数组存储赫夫曼树typedef char * *HuffmanCode; /动态分配数组存储赫夫曼编码表void HuffmanCoding(HuffmanTree &HT,HuffmanCode &HC,int *w,int n)/w存放n个字符的权值(均0),构造赫夫曼树HT，并求出n个字符的赫夫曼编码HC。int s1,s2,j,min1,min2;if(n=1) ret