哈夫曼树的构造哈夫曼树

//* * * * * * * * * * * * * * * * * * * * * * * * //哈夫曼树的构造哈夫曼树,哈夫曼编码 * //* * * * * * * * * * * * * * * * * * * * * * * * #include #include #include #include #include typedef struct {unsigned int weight; //结点权值 unsigned int parent,lchild,rchild; //结点的父指针，左右孩子指针 }HTNode,*HuffmanTree; //动态分配数组存储哈夫曼树 typedef char **HuffmanCode; //动态分配数组存储哈夫曼编码表 void CreateHuffmanTree(HuffmanTree &,unsigned int*,int ); //生成一棵哈夫曼树 void HuffmanCoding(HuffmanTree,HuffmanCode &,int ); //对哈夫曼树进行编码 void PrintHuffmanCode(HuffmanCode,unsigned int*,int); //显示哈夫曼编码 void Select(HuffmanTree,int,int&,int&); //在数组中寻找权值最小的两个结点 void main() {HuffmanTree HT; //哈夫曼树HT HuffmanCode HC; //哈夫曼编码表HC int n,i; //n 是哈夫曼树叶子结点数 unsigned int *w; //w 存放叶子结点权值 char j='y'; textbackground(3); //设定屏幕颜色 textcolor(15); clrscr(); //程序解说