采用顺序存储实现的哈夫曼树,并对结点进行编码
输入要求:
第一行,输入叶子结点个数
第二行,输入对应的权值
输出:
依次输出相应的哈夫曼编码。
例如:
输入示例:
6
9 12 6 3 5 15
输出示例
Huffman code is:
9:00
12:01
6:100
3:1010
5:1011
15:11
-----------------------------------------------------------
核心思想:
1、创建哈夫曼树(最优二叉树),遍历节点,找到双亲域为0,且权值最小的两个节点,生成新的含2*n-1个节点的树
2、按输入权值的顺序,从叶子节点回溯遍历到根节点,并设置,若该节点为其双亲节点的左孩子,则在编码表下标为n-2的位置写入编码‘0’,若该节点是其双亲节点的右孩子,则在编码表下标为n-2的位置写入‘1’,依次规律,第二个编码写在下标为n-3,第四个编码写在下表为n-4的位置。
3、得到编码表HC,通过遍历编码表,得到各个节点的哈夫曼编码。
完整代码如下:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define max 10
int arr[max];
typedef struct {
int weight;
int parent, lchild, rchild;
}HTNode, * HuffmanTree;
void Select(HuffmanTree& HT, int k, int* s1, int* s2) {
int min1, min2, i;
min1 = min2 = 100;
*s1 = *s2 = 0;
for (i = 1; i <= k; 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 CreateHuffmanTree(HuffmanTree& HT, int n) {
int s1, s2;
if (n <= 1)
return;
int m = 2 * n - 1;
HT = (HTNode*)malloc(sizeof(HTNode) * (m + 1));
for (int i = 1; i <= m; ++i) {
HT[i].parent = 0;
HT[i].lchild = 0;
HT[i].rchild = 0;
}
for (int i = 1; i <= n; ++i)
HT[i].weight = arr[i];
for (int i = n + 1; i <= m; ++i) {
Select(HT, i - 1, &s1, &s2);
HT[s1].parent = HT[s2].parent = i;
HT[i].lchild = s1;
HT[i].rchild = s2;
HT[i].weight = HT[s1].weight + HT[s2].weight;
}
}
typedef char** HuffmanCode;
void CreateHuffmanCode(HuffmanTree HT, HuffmanCode& HC, int n) {
HC = (HuffmanCode)malloc(sizeof(HuffmanCode) * (n + 1));
char* cd = (char*)malloc(sizeof(char) * n);
cd[n - 1] = '\0';
int i, c, f, start;
for (i = 1; i <= n; ++i) {
start = n - 1;
c = i;
f = HT[i].parent;
while (f != 0) {
--start;
if (HT[f].lchild == c)
cd[start] = '0';
else
cd[start] = '1';
c = f;
f = HT[f].parent;
}
HC[i] = (char*)malloc(sizeof(char) * (n - start));
strcpy(HC[i], &cd[start]);
}
free(cd);
}
int main() {
int i, n;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &arr[i]);
}
HuffmanTree HT;
CreateHuffmanTree(HT, n);
HuffmanCode HC;
CreateHuffmanCode(HT, HC, n);
printf("Huffman code is:\n");
for (i = 1; i <= n; i++) {
char* p = HC[i];
printf("%d:", HT[i].weight);
while (*p != '\0') {
printf("%c", *p++);
}
if (i <= n - 1) {
printf("\n");
}
}
return 0;
}
道阻且长,不懈努力。