基本概念:
结点带权路径长度(Weight Path Length,WPL):结点权值 x 根结点到结点自身的路径长度
树的带权路径长度:所有叶子结点WLP之和
Huffman树/最小二叉树的定义:
n个结点所构造出的WPL最小的二叉树
哈夫曼树的构建:
- 给定n个带权结点,将n个结点构成n棵二叉树的森林,每棵二叉树仅有一个根结点,没有左右子树。
- 从n个结点中选出两个根结点权值最小的树分别作为左右子树构造一棵新的二叉树,并置新的二叉树的根结点的权值为其左右子树的根结点的权值之和。
- 在森林中用新构造的二叉树代替原来的两棵树。
- 执行步骤2、3直至森林中只有一棵二叉树。
哈夫曼树的性质:
n个叶子结点的Huffman树共有2n-1个结点
给定n个带权结点的森林,构造一棵Huffman树:
Huffman树结点类型声明:
typedef struct
{
ElemType data;
double weight;
int parent;
int lchild;
int rchild;
}HufmTNode;
构造算法:
void CreateHuffmanTree(HufmTNode huffman_tree[], int n)
{
int i, k;
int min_index1, min_index2;
double min_weight1, min_weight2;
for(i=0; i<=2*n-2; i++)
huffman_tree[i].parent = huffman_tree[i].lchild = huffman_tree[i].rchild = -1;
for(i=n; i<=2*n-2; i++)
{
min_index1 = min_index = -1;
min_weight1 = min_weight2 = 32767;
for(k=0; k<=i-1; k++)
if(huffman_tree[k] == -1)
if(huffman_tree[k].weight < min_weight1)
{
min_weight2 = min_weight1;
min_index2 = min_index1;
min_weight1 = huffman_tree[k].weight;
min_index1 = k;
}
else if(huffman_tree[k].weight < min_weight2)
{
min_weight2 = huffman_tree[k].weight;
min_index2 = k;
}
huffman_tree[i].weight = huffman_tree[min_index1].weight + huffman_tree[min_index2].weight;
huffman_tree[i].lchild = min_index1;
huffman_tree[i].rchild = min_index2;
huffman_tree[min_index1] = huffmain_tree[min_index2] = i;
}
}