哈夫曼算法建立最优二叉树.docVIP

#includestdlib.h #includestdio.h #includetime.h #includestring #define MAX_NUMBER_OF_TREE_NODES 20 //树的结点的类型定义 typedef struct { unsigned int weight; unsigned int parent,lchild,rchild; }HTNode,*HuffmanTree; //子函数的声明部分 void InitTreeNode(HTNode); void CinWeightForTreeNode(HTNode); void GiveOrderForTreeNode(HTNode); void CopyTreeNodeOrTree(HTNode,HTNode); int main() { //定义将要用于构造哈弗曼树的结点 HTNode TreeNodes[MAX_NUMBER_OF_TREE_NODES+1]; //调用函数初始化数组结点 InitTreeNode(TreeNodes); //由用户输入各个结点的权值 CinWeightForTreeNode(TreeNodes); //对数组中的结点进行排序 GiveOrderForTreeNode(TreeNodes); return true; } //初始化结点值