哈夫曼树构造的代码实现嗯嗯

建议先学习哈夫曼树原理再来看该博客的代码实现
相关概念
叶子结点的权值：叶子结点的数值量，如某个字符出现的频率，修路的费用等
二叉树的带权路径长度：设二叉树有n个带权值的叶子结点，从根结点到各个叶子结点的路径长度与该叶结点的权值乘积的和
哈夫曼树：给定一组带权值的叶结点，带权路径长度最小的二叉树
哈夫曼树构造过程
对于n个带权叶结点，我们每次合并两个结点为一个，要经过n-1次合并我们才能合并成一棵哈夫曼树，而且这棵树有n-1个非叶结点，n个叶结点，一共有2*n-1个结点。其实细节很多，还是看代码把，读代码总能更快。
上代码

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

struct HuffmanNode {
	int weight;
	int parent, lchild, rchild;
};

bool cmp(const HuffmanNode& a, const HuffmanNode& b) {
	return a.weight < b.weight;
}

struct HuffmanTree {
	HuffmanNode* nodes;
	int leafnumber;
}T;


void CreateHuffmanTree(HuffmanTree& T, int leafnumber, int* weights) {

	//分配哈夫曼树存储空间
	T.nodes = new HuffmanNode[leafnumber * 2 - 1];
	T.leafnumber = leafnumber;

	//初始化叶结点
	for (int i = 0; i < leafnumber; i++) {
		T.nodes[i].weight = weights[i];
		T.nodes[i].parent = T.nodes[i].lchild = T.nodes[i].rchild = -1;
	}

	//对叶结点按权值从小到大排序
	sort(T.nodes, T.nodes + leafnumber, cmp);

	//开始构造哈夫曼树
	int s = 0, t = leafnumber;//分别指向叶结点和非叶结点
	for (int i = 0; i < leafnumber - 1; i++) {

		//选择第一个权值最小的叶结点
		int k1;
		if (s < leafnumber && (t >= leafnumber + i || T.nodes[s].weight < T.nodes[t].weight))
			k1 = s++;
		else
			k1 = t++;

		//选择第一个权值最小的叶结点
		int k2;
		if (s < leafnumber && (t >= leafnumber + i || T.nodes[s].weight < T.nodes[t].weight))
			k2 = s++;
		else
			k2 = t++;

		//将根结点k1根结点k2合并到新增根结点i+leafnumber中
		T.nodes[i + leafnumber].weight = T.nodes[k1].weight + T.nodes[k2].weight;
		T.nodes[i + leafnumber].lchild = k1;
		T.nodes[i + leafnumber].rchild = k2;
		T.nodes[i + leafnumber].parent = -1;
		T.nodes[k1].parent = i + leafnumber;
		T.nodes[k2].parent = i + leafnumber;
	}
}
void printPre(HuffmanNode a) { //前序遍历各个结点权值
	printf("%d\n", a.weight);
	if (a.lchild == -1 && a.rchild == -1)
		return;
	printPre(T.nodes[a.lchild]);
	printPre(T.nodes[a.rchild]);
}
int main()
{
	int a[] = { 1,2,3,4,5 };
	CreateHuffmanTree(T, 5, a);
	printPre(T.nodes[T.leafnumber*2-2]);
}

哈夫曼编码