数据结构-哈夫曼树的实现(C语言+部分注释)

什么是哈夫曼树?

首先我们要介绍一个概念--带权路径长度

而我们的的哈夫曼树的作用即是保证所有叶子结点的带权路径长度最小

:

那么?怎么做到呢;

我们直接说结论:

哈夫曼编码

代码实现

接口

#include <stdio.h>
#include <stdlib.h>
typedef struct treeNode {
	int weight;
	int parent;
	int lchild;
	int rchild;
}treeNode;
typedef struct huffmanTree {
	treeNode* data;
	int length;
}hfTree;
hfTree* hfTreeInit(int* weight, int length);
int* selectMin(hfTree* T) ;
void creatHuffmanTree(hfTree* T);
void preOrder(hfTree* T, int index);

接口实现

hfTree* hfTreeInit(int* weight, int length) {
	hfTree* T = (hfTree*)malloc(sizeof(hfTree));
	T->data = (treeNode*)malloc(sizeof(treeNode) * (2 * length - 1));//由n个结点形成的哈夫曼树有2n-1个结点
	T->length = length;
	for (int i = 0; i < length; i++) {
		T->data[i].weight = weight[i];
		//-1代表没有孩子
		T->data[i].lchild = -1;
		T->data[i].rchild = -1;
		T->data[i].parent = 0;
	}
	return T;
}
int* selectMin(hfTree* T) {
	int min = 10000;
	int secondMin = 10000;
	int minIndex = 0;
	int secondIndex = 0;
	for (int i = 0; i < T->length; i++) {
		if (T->data[i].parent == 0) {
			if (T->data[i].weight < min) {
				min = T->data[i].weight;
				minIndex = i;
			}
		}
	}
	for (int i = 0; i < T->length; i++) {
		if (T->data[i].parent == 0 && i != minIndex) {
			if (T->data[i].weight < secondMin) {
				secondMin = T->data[i].weight;
				secondIndex = i;
			}
		}
	}
	int* res = (int*)malloc(sizeof(int) * 2);//接收索引

	res[0] = minIndex;
	res[1] = secondIndex;
	return res;
}
void creatHuffmanTree(hfTree* T) {
	int length = T->length * 2 - 1;//边界
	int* res;
	int min = -1;
	int secondMin = -1;
	for (int i = T->length; i < length; i++) {
		//因为数组中已经存放了初始的T->length的值,所以下标从T->length开始
		res = selectMin(T);
		//获得索引
		min = res[0];
		secondMin = res[1];
		T->data[i].weight = T->data[min].weight + T->data[secondMin].weight;
		T->data[i].parent = 0;
		T->data[min].parent = i;
		T->data[secondMin].parent = i;
		T->data[i].lchild = min;
		T->data[i].rchild = secondMin;
		T->length++;
	}
}
void preOrder(hfTree* T, int index) {
	if (index != -1) {
		//因为树结点都储存在一个数组中,我们通过下标访问,
		printf("%d ", T->data[index].weight);
		preOrder(T, T->data[index].lchild);
		preOrder(T, T->data[index].rchild);
	}
}

测试

int main() {
	int weight[5] = { 1,2,3,4,5 };
	hfTree* T = hfTreeInit(weight, 5);
	creatHuffmanTree(T);
	preOrder(T, T->length - 1);
	return 0;
}