#include <stdio.h>
#define MAXBIT 100
#define MAXVALUE 10000
#define MAXLEAF 30
#define MAXNODE MAXLEAF*2-1
typedef struct
{
int bit[MAXBIT];
int start;
}HCodeType;
typedef struct
{
int weight;
int parent;
int lchild;
int rchild;
}HNodeType;
void HuffmanTree(HNodeType HuffNode[MAXNODE], int n)
{
int i, j, m1, m2, x1, x2;
for (i = 0; i < 2 * n - 1; i++)
{
HuffNode[i].weight = 0;
HuffNode[i].parent = -1;
HuffNode[i].lchild = -1;
HuffNode[i].rchild = -1;
}
for (i = 0; i < n; i++)
{
printf("Please input weight of leaf node %d: \n", i);
scanf("%d", &HuffNode[i].weight);
}
for (i = 0; i < n - 1; i++)
{
m1 = m2 = MAXVALUE;
x1 = x2 = 0;
for (j = 0; j < n + i; j++)
{
if (HuffNode[j].weight < m1&&Hu
赫夫曼编码C语言实现
最新推荐文章于 2024-05-10 16:58:28 发布