最小堆应用---用最小堆实现huffman树

最新推荐文章于 2024-01-24 23:21:54 发布

iteye_14216

最新推荐文章于 2024-01-24 23:21:54 发布

阅读量378

点赞数 1

分类专栏： Data Structure 文章标签： c/c++

Data Structure 专栏收录该内容

6 篇文章

订阅专栏

本文介绍如何使用最小堆来构建Huffman树，这是形成Huffman编码的基础。通过C++代码示例展示了从创建节点到合并节点的全过程，并利用最小堆优化了Huffman树的构建过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

最小堆应用---用最小堆实现huffman树,huffman是形成huffman编码的基础.
[code]
#include"MinHeap.h"

template<class T> class HuffmanTree;
template<class T>
class TreeNode{
friend class HuffmanTree<T>;
private:
T data;
TreeNode<T> *left,*right;
public:
TreeNode(T value){
data = value;
left = right = NULL;
}
TreeNode(){
left = right = NULL;
}
bool operator > (const TreeNode &node){
return data > node.data;
}
bool operator < (const TreeNode &node){
return data < node.data;
}
bool operator == (const TreeNode &node){
return data == node.data;
}
bool operator >= (const TreeNode &node){
return data >= node.data;
}
};

template <class T>
class HuffmanTree{
public:
HuffmanTree();
HuffmanTree(T value[],int n);
protected:
TreeNode<T> *JoinTree(TreeNode<T> &node1,TreeNode<T> &node2);
TreeNode<T> *root;
};

template<class T>
HuffmanTree<T>::HuffmanTree():root(NULL){
}

template<class T>
HuffmanTree<T>::HuffmanTree(T value[],int n):root(NULL){
TreeNode<T> *nodes = new TreeNode<T>[n];
TreeNode<T> leftNode,rightNode;
int i = 0;
for(i = 0; i < n; i++){
nodes[i] = TreeNode<T>(value[i]);
}
MinHeap< TreeNode<T> > *m_heap = new MinHeap< TreeNode<T> >(nodes,n);

for(i = 0; i < n-1; i++){
m_heap->RemoveMin(leftNode);
m_heap->RemoveMin(rightNode);
root = JoinTree(leftNode,rightNode);
m_heap->Insert(*root);
}
}

template<class T>
TreeNode<T> *HuffmanTree<T>::JoinTree(TreeNode<T> &node1,TreeNode<T> &node2){
TreeNode<T> *r = new TreeNode<T>;
r->left = &node1;
r->right = &node2;
r->data = node1.data + node2.data;
return r;
}

[/code]