构造哈夫曼树 键入权重并进行对节点的先序遍历【C++】

1.题目要求

构造哈夫曼树

给出以下权重2, 3, 7, 9, 18, 25，构造哈夫曼树。 以先序遍历方式输出节点，换行隔开。

注意：构造哈夫曼树时，节点值小的在左侧。

2.完整代码

#include <iostream>
#include <malloc.h>
using namespace std;

//哈夫曼树结点结构体
struct HTnode
{
	int weight;//权值
	int parent, lchild, rchild;//父节点下标，左右孩子节点下标
};

void minTow(HTnode*& arr, int& s1, int& s2, int n, int number_new_node)
{

	//找s1
	int min = arr[1].weight;
	for (int i = 1; i <= n + number_new_node; i++)
	{
		if (min < arr[i].weight)
		{
			min = arr[i].weight;
		}
	}
	for (int i = 1; i <= n + number_new_node; i++)
	{
		if (arr[i].parent == 0 && min >= arr[i].weight)
		{
			s1 = i;
			min = arr[i].weight;
		}
	}

	//找s2
	min = arr[1].weight;
	for (int i = 1; i <= n + number_new_node; i++)
	{
		if (min < arr[i].weight)
		{
			min = arr[i].weight;
		}
	}
	for (int i = 1; i <= number_new_node + n; i++)
	{
		if (arr[i].parent == 0 && min >= arr[i].weight && s1 != i)
		{
			s2 = i;
			min = arr[i].weight;
		}
	}
}

//创建Haffman树
HTnode* CreateHuffmanTree(int n)
{
	HTnode* arr = (HTnode*)malloc(sizeof(HTnode) * 2 * n);

	//给节点初始化
	cout << "请输入权重："<<endl;
	for (int i = 1; i <= n; i++)
	{
		cout << "第" << i << "个权重：";

		cin >> arr[i].weight;
	}
	for (int i = 0; i < n * 2; i++)
	{
		arr[i].parent = arr[i].lchild = arr[i].rchild = 0;
	}
	int number_new_node = 0;//新生成节点的值
	//创建哈夫曼树
	for (int k = 1; k < n; k++)
	{
		int s1, s2;
		minTow(arr, s1, s2, n, number_new_node);

		//产生新的节点
		number_new_node++;

		arr[n + number_new_node].weight = arr[s1].weight + arr[s2].weight;
		arr[n + number_new_node].lchild = s1;
		arr[n + number_new_node].rchild = s2;
		//修改权值最小节点的父节点
		arr[s1].parent = n + number_new_node;
		arr[s2].parent = n + number_new_node;

	}
	return arr;
}

//哈夫曼树的遍历(前序遍历递归)
void  OrderHaffmanTree(int num, HTnode*& arr)
{
	if (num == 0)//num等于0为空
	{
		return;
	}


	cout << arr[num].weight << endl;
	OrderHaffmanTree(arr[num].lchild, arr);
	OrderHaffmanTree(arr[num].rchild, arr);

}

int main()
{
	
	cout << "权重个数：";
	int n;
	cin >> n;
	cout << "根据，节点个数=2*（权重个数）-1=" << 2 * n - 1 << endl;
	HTnode* arr = CreateHuffmanTree(n);
	cout << "前序遍历："<<endl;
	OrderHaffmanTree(2 * n - 1, arr);//有n个权值构造的哈夫曼树有2*n个节点
	cout << endl;
	return 0;
}

3.运行结果