哈夫曼树的学习

目录

一 哈夫曼树的构造与编码

1 哈夫曼树结点的定义

2 哈夫曼树的构造

3 选择两个小权值的函数

4 哈夫曼编码

5 打印

6 主函数

7 全部代码

8 运行结果

---

一 哈夫曼树的构造与编码

1 哈夫曼树结点的定义

typedef struct {
	int weight;						
	int parent;						
	int LChild;						
	int RChild;						
}HTNode, HuffmanTree[M + 1];	

typedef char **HuffmanCode;

2 哈夫曼树的构造

void CrtHuffmanTree(HuffmanTree ht, int w[], int n) {

	int i;
	for (i = 1; i <= n; i++) {		
		ht[i].weight = w[i - 1];
		ht[i].parent = 0;
		ht[i].LChild = 0;
		ht[i].RChild = 0;
	}
	int m = 2 * n - 1;				
	for (i = n + 1; i <= m; i++) {	
		ht[i].weight = 0;
		ht[i].parent = 0;
		ht[i].LChild = 0;
		ht[i].RChild = 0;
	}

	
	int s1, s2;
	for (i = n + 1; i <= m; i++) {	
		Select(ht, i - 1, &s1, &s2);
		ht[i].weight = ht[s1].weight + ht[s2].weight;
		ht[s1].parent = i;
		ht[s2].parent = i;
		ht[i].LChild = s1;
		ht[i].RChild = s2;
	}
}

3 选择两个小权值的函数

HuffmanTree ht;


void Select(HuffmanTree ht, int n, int* s1, int* s2) {
	int i, min1 = MAX, min2 = MAX;
	*s1 = 0;
	*s2 = 0;
	for (i = 1; i <= n; i++) {
		if (ht[i].parent == 0) {
			if (ht[i].weight < min1) {
				min2 = min1;
				*s2 = *s1;
				min1 = ht[i].weight;
				*s1 = i;
			}
			else if (ht[i].weight < min2) {
				min2 = ht[i].weight;
				*s2 = i;
			}
		}
	}
}

4 哈夫曼编码

void CrtHuffmanCode(HuffmanTree ht,HuffmanCode &HC, int n) {
	HC=(HuffmanCode)malloc((n+1)*sizeof(char *));
	
	char* cd;
	cd = (char*)malloc(n * sizeof(char));	//分配当前编码的工作空间
	for (int i = 1; i <= n; i++) {			
		int start = n - 1, c = i, p = ht[i].parent;
		while (p != 0) {
			--start;
			if (ht[p].LChild == c)			//左分支标0
				cd[start] = '0';
			else
				cd[start] = '1';			//右分支标1
			c = p;							//向上倒堆
			p = ht[p].parent;
		}
		
	HC[i] = (char *)malloc((n - start) * sizeof(char));
    strcpy(HC[i], &cd[start]);

	}
}

5 打印

void print(HuffmanCode HC,char str[],int n){
	for (int i = 1; i <= 9; i++)
		printf("%d ", ht[i].weight);
	printf("\n");
	for(int i=1;i<=n;i++){
		printf("%c的哈夫曼编码: ",str[i-1]);
		printf("%s\n",HC[i]);
	}	
}

6 主函数

int main() {
	int i, w[5] = { 2,3,5,7,8 };
	char str[5] = { 'c','s','e','a','t' };
	
	CrtHuffmanTree(ht, w, 5);
	
	HuffmanCode HC;
	CrtHuffmanCode(ht,HC,5);
	print(HC,str,5);
	return 0;
}

7 全部代码

# include<stdio.h>
# include<malloc.h>
# include<string.h>
# define N 10						
# define M 2 * N - 1				
# define MAX 1000


typedef struct {
	int weight;						
	int parent;						
	int LChild;						
	int RChild;						
}HTNode, HuffmanTree[M + 1];	

typedef char **HuffmanCode;


HuffmanTree ht;


void Select(HuffmanTree ht, int n, int* s1, int* s2) {
	int i, min1 = MAX, min2 = MAX;
	*s1 = 0;
	*s2 = 0;
	for (i = 1; i <= n; i++) {
		if (ht[i].parent == 0) {
			if (ht[i].weight < min1) {
				min2 = min1;
				*s2 = *s1;
				min1 = ht[i].weight;
				*s1 = i;
			}
			else if (ht[i].weight < min2) {
				min2 = ht[i].weight;
				*s2 = i;
			}
		}
	}
}


void CrtHuffmanTree(HuffmanTree ht, int w[], int n) {

	int i;
	for (i = 1; i <= n; i++) {		
		ht[i].weight = w[i - 1];
		ht[i].parent = 0;
		ht[i].LChild = 0;
		ht[i].RChild = 0;
	}
	int m = 2 * n - 1;				
	for (i = n + 1; i <= m; i++) {	
		ht[i].weight = 0;
		ht[i].parent = 0;
		ht[i].LChild = 0;
		ht[i].RChild = 0;
	}

	
	int s1, s2;
	for (i = n + 1; i <= m; i++) {	
		Select(ht, i - 1, &s1, &s2);
		ht[i].weight = ht[s1].weight + ht[s2].weight;
		ht[s1].parent = i;
		ht[s2].parent = i;
		ht[i].LChild = s1;
		ht[i].RChild = s2;
	}
}


void CrtHuffmanCode(HuffmanTree ht,HuffmanCode &HC, int n) {
	HC=(HuffmanCode)malloc((n+1)*sizeof(char *));
	
	char* cd;
	cd = (char*)malloc(n * sizeof(char));	
	for (int i = 1; i <= n; i++) {			
		int start = n - 1, c = i, p = ht[i].parent;
		while (p != 0) {
			--start;
			if (ht[p].LChild == c)			//左分支标0
				cd[start] = '0';
			else
				cd[start] = '1';			//右分支标1
			c = p;							//向上倒堆
			p = ht[p].parent;
		}
		
	HC[i] = (char *)malloc((n - start) * sizeof(char));
    strcpy(HC[i], &cd[start]);

	}
}

void print(HuffmanCode HC,char str[],int n){
	for (int i = 1; i <= 9; i++)
		printf("%d ", ht[i].weight);
	printf("\n");
	for(int i=1;i<=n;i++){
		printf("%c的哈夫曼编码: ",str[i-1]);
		printf("%s\n",HC[i]);
	}	
}

int main() {
	int i, w[5] = { 2,3,5,7,8 };
	char str[5] = { 'c','s','e','a','t' };
	
	CrtHuffmanTree(ht, w, 5);
	
	HuffmanCode HC;
	CrtHuffmanCode(ht,HC,5);
	print(HC,str,5);
	return 0;
}

8 运行结果