摘要： ------ 赫夫曼树和赫夫曼编码的存储表示------typedef struct { unsigned int weight; unsigned int parent,lchild,rchild;}HTNode,*HuffmanTree;typedef char ** HuffmanCode;void HuffmanCoding(HuffmanTree& HT,HuffmanCode & HC,int *w,int n) { if (n < 1) return;\ int m = 2* n + 1; HT = (HuffmanTree) malloc (m+1)* s 阅读全文