哈弗曼树试验一：构建哈弗曼树HuffmanTree

最新推荐文章于 2024-01-30 23:45:44 发布

原创最新推荐文章于 2024-01-30 23:45:44 发布 · 580 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #算法

c++ 同时被 2 个专栏收录

68 篇文章

订阅专栏

算法

63 篇文章

订阅专栏

本文详细介绍了使用C++编程语言构建哈弗曼树的过程，包括关键步骤和算法实现，旨在帮助读者理解哈弗曼编码的构建原理。

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

#include <stdio.h>  
#include <vector>  
#include <iostream>  
#include <algorithm>
using namespace std;
/**
* Definition for binary tree
**/
struct TreeNode {
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

//先序遍历  
void PreOrder(TreeNode *root)
{
	if (root == NULL)
		return;
	std::cout << root->val << ' ';
	PreOrder(root->left);
	PreOrder(root->right);
}

//中序遍历  
void InOrder(TreeNode *root)
{
	if (root == NULL)
		return;
	InOrder(root->left);
	std::cout << root->val << " ";
	InOrder(root->right);
}

//后序遍历  
void PostOrder(TreeNode *root)
{
	if (root == NULL) return;
	PostOrder(root->left);
	PostOrder(root->right);
	std::cout << root->val << ' ';
}

//哈弗曼树结点比较
bool HfCompare(TreeNode *node1, TreeNode *node2)
{
	return node1->val < node2->val;
}
//根据结点序列构建哈弗曼树
TreeNode* ConstructHuffmanTree(vector<TreeNode *> &treeNodes)
{
	TreeNode *root = NULL;
	if (treeNodes.empty())
		return root;
	while (treeNodes.size() > 1)
	{
		//权值从小到大排序，取最小的两个结点合并
		sort(treeNodes.begin(), treeNodes.end(), HfCompare);
		TreeNode *leftNode = treeNodes[0];
		TreeNode *rightNode = treeNodes[1];
		TreeNode *tempNode = new TreeNode(leftNode->val + rightNode->val);
		tempNode->left = leftNode;
		tempNode->right = rightNode;
		treeNodes.erase(treeNodes.begin());
		treeNodes.erase(treeNodes.begin());
		treeNodes.push_back(tempNode);
		if (treeNodes.size() == 1)
			root = treeNodes[0];
	}
	return root;
}

int main()
{
	vector<TreeNode *> treeNodes;
	int val = 0;
	while (cin >> val)
	{
		TreeNode *tempNode = new TreeNode(val);
		treeNodes.push_back(tempNode);
	}
	TreeNode *root = ConstructHuffmanTree(treeNodes);

	PreOrder(root);    //先序输出  
	std::cout << std::endl;
	InOrder(root);     //中序输出  
	std::cout << std::endl;
	system("pause");
	return 0;
}