哈夫曼树与哈夫曼编码c语言代码实现
时间: 2023-11-06 21:00:09 浏览: 85
哈夫曼树与哈夫曼编码是一种常用的数据压缩算法,下面是C语言代码实现:
```
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX_SIZE 1000
#define MAX_BIT 30
typedef struct node {
int weight;
int flag;
struct node *left, *right;
} Node;
typedef struct {
int bit[MAX_BIT];
int start;
} HCode;
Node *buildHuffmanTree(int *a, int n) {
Node **node, *parent, *left, *right;
node = (Node **)malloc(sizeof(Node *) * n);
for (int i = 0; i < n; i++) {
node[i] = (Node *)malloc(sizeof(Node));
node[i]->weight = a[i];
node[i]->flag = 0;
node[i]->left = NULL;
node[i]->right = NULL;
}
for (int i = 0; i < n - 1; i++) {
int min1 = MAX_SIZE, min2 = MAX_SIZE;
int index1 = -1, index2 = -1;
for (int j = 0; j < n; j++) {
if (!node[j]->flag && node[j]->weight < min1) {
min2 = min1;
index2 = index1;
min1 = node[j]->weight;
index1 = j;
} else if (!node[j]->flag && node[j]->weight < min2) {
min2 = node[j]->weight;
index2 = j;
}
}
parent = (Node *)malloc(sizeof(Node));
left = node[index1];
right = node[index2];
parent->weight = left->weight + right->weight;
parent->flag = 0;
parent->left = left;
parent->right = right;
node[index1] = parent;
node[index2]->flag = 1;
}
free(node);
return parent;
}
void getCode(Node *root, HCode *hcode, int len) {
if (root->left == NULL && root->right == NULL) {
printf("%d: ", root->weight);
for (int i = 0; i < len; i++) {
printf("%d", hcode->bit[i]);
}
printf("\n");
return;
} else {
if (root->left != NULL) {
hcode->bit[len] = 0;
hcode->start++;
getCode(root->left, hcode, len + 1);
hcode->start--;
}
if (root->right != NULL) {
hcode->bit[len] = 1;
hcode->start++;
getCode(root->right, hcode, len + 1);
hcode->start--;
}
}
}
int main() {
int a[MAX_SIZE], n;
printf("请输入数字的个数:");
scanf("%d", &n);
printf("请输入数字:");
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
Node *root = buildHuffmanTree(a, n);
HCode *hcode = (HCode *)malloc(sizeof(HCode));
hcode->start = 0;
printf("哈夫曼编码:\n");
getCode(root, hcode, 0);
return 0;
}
```
代码实现中,`buildHuffmanTree()`函数用来构建哈夫曼树,`getCode()`函数用来对哈夫曼树进行遍历并生成哈夫曼编码。在主函数中,先输入数字的个数和数字,然后调用上述两个函数生成哈夫曼编码。