哈夫曼树与哈夫曼编码:
哈夫曼树的定义:
带权路径长度
(
W
P
L
)
(WPL)
(WPL):设二叉树有n个叶子结点,每个叶子结点带有权值
w
k
w_k
wk,从根结点到每个叶子结点的长度为
l
k
l_k
lk,则每个叶子结点的带权路径长度之和就是:
W
P
L
=
∑
k
=
1
n
w
k
l
k
WPL=\sum_{k=1}^n w_kl_k
WPL=∑k=1nwklk
最优二叉树或哈夫曼树:
W
P
L
WPL
WPL最小的二叉树
哈夫曼树的构造 :
每次把权值最小的两棵二叉树合并
typedef struct TreeNode *HuffmanTree;
struct TreeNode{
int Weight;
HuffmanTree Left, Right;
}
HuffmanTree Huffman( MinHeap H ) {
/* 假设H->Size个权值已经存在H->Elements[]->Weight里 */
int i;
HuffmanTree T;
BuildMinHeap(H); /*将H->Elements[]按权值调整为最小堆*/
for (i = 1; i < H->Size; i++) { /*做H->Size-1次合并*/
T = malloc( sizeof( struct TreeNode) ); /*建立新结点*/
T->Left = DeleteMin(H); /*从最小堆中删除一个结点,作为新T的左子结点*/
T->Right = DeleteMin(H); /*从最小堆中删除一个结点,作为新T的右子结点*/
T->Weight = T->Left->Weight+T->Right->Weight;/*计算新权值*/
Insert( H, T ); /*将新T插入最小堆*/
}
T = DeleteMin(H);
return T;
}
//转自https://www.icourse163.org/learn/ZJU-93001?tid=1206471203#/learn/content?type=detail&id=1211167094&cid=1213729254