#include
#include
//哈夫曼树定义
typedef struct {
int weight;
int parent, lchild, rchild;
}HTNode, *HuffmanTree;
//选择两个双亲域为0且权值最小的结点,并返回在HT中的序号s1,s2
void Select(HuffmanTree &HT, int n, int &s1, int &s2)
{
//寻找第一个双亲域为0且权值最小的结点
int min;
for (int i = 1; i <= n; i++) //找到第一个双亲域为0的,下标暂存到min
{
if (HT[i].parent == 0)
{
min = i;
break;
}
}
for (int i = 1; i <= n; i++)
{
if (HT[i].parent == 0)
{
if (HT[i].weight < HT[min].weight)
{
min = i;
}
}
}
s1 = min;
//寻找第二个双亲域为0且权值最小的结点
for (int i = 1; i <= n; i++) //找到第一个双亲域为0的,下标暂存到min
{
if (HT[i].parent == 0 && i != s1)
{
min = i;
break;
}
}
for (int i = 1; i <= n; i++)
{
if (HT[i].parent == 0 && i != s1)
{
if (HT[i].weight < HT[min].weight)
{
min = i;
}
}
}
s2 = min;
}
//输出
void println(HuffmanTree &HT, int m)
{
printf("==============================\n");
for (int i = 1; i <= m; i++)
{
printf("%d, ", i);
printf("%d ", HT[i].weight);
printf("%d ", HT[i].parent);
printf("%d ", HT[i].lchild);
printf("%d \n", HT[i].rchild);
printf("---------------------------\n");
}
}
//创建哈夫曼树
void CreateHuffmanTree(HuffmanTree &HT, int n)
{
//初始化
int i, m = 2 * n - 1, s1, s2; //m为所有结点的个数
if (n <= 1) return;
HT = new HTNode[m + 1]; //0号不用从1开始,多申请一行,前1~n存放叶子结点
for (i = 1; i <= m; ++i) //遍历每一个结点并赋值为0
{
HT[i].parent = 0;
HT[i].lchild = 0;
HT[i].rchild = 0;
}
//创建树
for (i = 1; i <= n; ++i) //把叶子结点权值放入表中
{
printf("请输入第%d个叶子:", i);
scanf("%d", &(HT[i].weight));
}
printf("\nHT的初态\n");
println(HT, m);
for (int i = n + 1; i <= m; ++i) //从非叶子结点开始创建
{
Select(HT, i - 1, s1, s2); //选择两个最小的结点
HT[s1].parent = i;
HT[s2].parent = i; //把叶子结点双亲域赋上
HT[i].lchild = s1;
HT[i].rchild = s2;
HT[i].weight = HT[s1].weight + HT[s2].weight;
}
printf("\nHT的终态\n");
println(HT, m);
}
int main() {
HuffmanTree HT;
int n; //n为叶子节点的个数
printf("请输入叶子节点的个数:");
scanf("%d", &n);
CreateHuffmanTree(HT, n);
}