哈夫曼树的创建和遍历

#include<iostream>
#include<algorithm>
#include<iomanip>
using namespace std;

//创建哈夫曼树的存储表示
typedef struct
{
	int weight;                    //节点的权值
	int parent, lchild, rchild;    //节点的双亲，左孩子，右孩子的下标
}HTNode,*HuffmanTree;

void Select(HuffmanTree HT, int n, int& s1, int& s2)
{
	//初始化s1的双亲为0
	for (int i = 1; i < n; i++)
	{
		if (HT[i].parent == 0)
		{
			s1 = i;
			break;
		}
	}
	//s1为权值最小的坐标
	for (int i = 1; i < n; i++)
	{
		if (HT[i].parent == 0 && HT[i].weight < HT[s1].weight)
			s1 = i;
	}
	//初始化s2的双亲为零
	for (int j = 1; j < n; j++)
	{
		if (HT[j].parent == 0 && j != s1)
		{
			s2 = j; 
			break;
		}
	}
	//s2为另一个权值最小的下标
	for (int j = 1; j < n; j++)
	{
		if (HT[j].parent == 0 && j != s1 && HT[j].weight < HT[s2].weight)
			s2 = j;
	}
}

void CreateHuffmanTree(HuffmanTree& HT, int n)
{
	//构建哈夫曼树HT,即初始化
	if (n <= 1) return;
	int m = 2 * n - 1;
	HT = new HTNode[m + 1];
	for (int i = 1; i <= m; i++)
	{
		HT[i].parent = 0;
		HT[i].lchild = 0;
		HT[i].rchild = 0;
	}
	cout << "请输入各个节点的权值：" << endl;
	for (int i = 1; i <= n; i++)
	{
		cin >> HT[i].weight;
	}
	//构建哈夫曼树
	for (int i = n + 1; i <= m; ++i)
	{
		//通过n-1次的选择、删除、合并来创建哈夫曼树
		int s1, s2;
		Select(HT, i, s1, s2);
		HT[s1].parent = i;
		HT[s2].parent = i;   //相当于从表F中删除s1, s2
		HT[i].lchild = s1;
		HT[i].rchild = s2;
		HT[i].weight = HT[s1].weight + HT[s2].weight;
	}
}

void showHT(HuffmanTree HT, int n)
{
	cout << "哈夫曼树以表格的形式答应出来为：" << endl;
	cout << "index  weight  parent  lchild  rchild" << endl;
	cout << left;//左对齐输出
	int m = 2 * n - 1;
	for (int i = 1; i <= m; i++)
	{
		cout << setw(5) << i << "  ";         
		cout << setw(6) << HT[i].weight << "  ";   
		cout << setw(6) << HT[i].parent << "  ";
		cout << setw(6) << HT[i].lchild << "  ";
		cout << setw(6) << HT[i].rchild << "  " << endl;
	}
}

int main()
{
	HuffmanTree HT;
	cout << "请输入有多少个节点：" << endl;
	int n;
	cin >> n;
	CreateHuffmanTree(HT, n);
	showHT(HT, n);
	return 0;
}

结果如下：