//哈夫曼树
//线性表示
#include<iostream>
#include<string.h>
using namespace std;
#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;
char value;
}HNodeType;
void HuffmanTree(HNodeType HuffNode[], 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;
HuffNode[i].value = i;
}
for (i = 0; i < n; i++)
{
cout << "请输入第" << i + 1 << "个结点的权值" << endl;
cin >> HuffNode[i].weight;
cout << "请输入第" << i + 1 << "个结点的值" << endl;
cin >> HuffNode[i].value;
}
for (i = n; i < 2 * n - 1; i++)
{
HuffNode[i].value = 48;
HuffNode[i].parent = -1;
HuffNode[i].lchild = -1;
HuffNode[i].rchild = -1;
HuffNode[i].weight = 0;
}
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 && HuffNode[j].parent == -1)
{
m2 = m1;
x2 = x1;
m1 = HuffNode[j].weight;
x1 = j;
}
else if (HuffNode[j].weight < m2 && HuffNode[j].parent == -1)
{
m2 = HuffNode[j].weight;
x2 = j;
}
}
HuffNode[x1].parent = n + i;
HuffNode[x2].parent = n + i;
HuffNode[n + i].weight = HuffNode[x1].weight + HuffNode[x2].weight;
HuffNode[n + i].lchild = x1;
HuffNode[n + i].rchild = x2;
cout << "x1.weight :" << HuffNode[x1].weight << "+ x2.weight " << HuffNode[x2].weight << "=" << HuffNode[n + i].weight << endl;
cout << "它的左子树为" << HuffNode[n + i].lchild << "的值为:" << HuffNode[HuffNode[n + i].lchild].value;
cout << "它的右子树为" << HuffNode[n + i].rchild << "的值为:" << HuffNode[HuffNode[n + i].rchild].value;
HuffNode[x1].weight = MAXVALUE;
HuffNode[x2].weight = MAXVALUE;
}
}
void decodeing(char string[], HNodeType Buf[], int n)
{
int tmp = 0;
int i = 0;
int ptr = 2*n-2;
while (string[i] != '\n')
{
if (string[i] - 48== 0 && Buf[ptr].lchild!=-1)
{
ptr = Buf[ptr].lchild;
}
else
{
if(string[i] - 48 == 1 && Buf[ptr].rchild != -1)
ptr = Buf[ptr].rchild;
}
i++;
}
cout << "解码的值为:" << Buf[ptr].value;
}
int main()
{
HNodeType HuffNode[MAXNODE];
int n;
cout << "请输入结点的个数" << endl;
cin >> n;
HuffmanTree(HuffNode, n);
char string[255];
for (int i = 0; i < 3; i++)
{
cout << "请输入编码" << endl;
cin >> string;
decodeing(string, HuffNode, n);
}
return 0;
}