数据结构

完成函数构造哈夫曼树。图中8表示有8个叶子结点，然后输入8个叶子结点的权值。输出HT表的终态（构造要求将先出现的放置在左子树，后出现的放置在右子树上，下标从1开始，0下标不使用）。

分数:

请勿频繁操作

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct _HuffmanRec
{
	int weight;
	int parent;
	int lchild;
	int rchild;
} HuffmanRec, *pHuffmanRec;

int InitHuff(pHuffmanRec *HT, int n);
int CreateHuffman(pHuffmanRec HT, int n);
void out(pHuffmanRec HT, int n); 

int main(void)
{
	int n;
	pHuffmanRec HT;

	printf("Input n:");
	scanf("%d", &n);
	if (InitHuff(&HT, n) < 0)
	{
		return 0;
	}

	CreateHuffman(HT, n);
	out(HT, n);
	return 0;
}

int InitHuff(pHuffmanRec *HT, int n)
{
	int i;
	int weight;

	(*HT) = (pHuffmanRec)malloc(2 * n * sizeof(HuffmanRec));	//0下标不使用
	if ((*HT) == NULL)
	{
		return -1;
	}
	memset(*HT, 0, 2 * n * sizeof(HuffmanRec));
	printf("Input the weight:\n");
	for (i = 1; i <= n; i++)
	{
		scanf("%d", &weight);
		(*HT)[i].weight = weight;
	}
	return 1;
}

void out(pHuffmanRec HT, int n)
{
	int i;

	printf("\tweight\tparent\tlchild\trchild\n");
	for (i = 1; i <= 2 * n - 1; i++)
	{
		printf("%d\t%d\t%d\t%d\t%d\n", i, HT[i].weight, HT[i].parent, HT[i].lchild, HT[i].rchild);
	}
}

/******start******/

/******end******/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct _HuffmanRec
{
	int weight;
	int parent;
	int lchild;
	int rchild;
} HuffmanRec, *pHuffmanRec;

int InitHuff(pHuffmanRec *HT, int n);
int CreateHuffman(pHuffmanRec HT, int n);
void out(pHuffmanRec HT, int n); 

int main(void)
{
	int n;
	pHuffmanRec HT;

	printf("Input n:");
	scanf("%d", &n);
	if (InitHuff(&HT, n) < 0)
	{
		return 0;
	}

	CreateHuffman(HT, n);
	out(HT, n);
	return 0;
}

int InitHuff(pHuffmanRec *HT, int n)
{
	int i;
	int weight;

	(*HT) = (pHuffmanRec)malloc(2 * n * sizeof(HuffmanRec));	//0下标不使用
	if ((*HT) == NULL)
	{
		return -1;
	}
	memset(*HT, 0, 2 * n * sizeof(HuffmanRec));
	printf("Input the weight:\n");
	for (i = 1; i <= n; i++)
	{
		scanf("%d", &weight);
		(*HT)[i].weight = weight;
	}
	return 1;
}

void out(pHuffmanRec HT, int n)
{
	int i;

	printf("\tweight\tparent\tlchild\trchild\n");
	for (i = 1; i <= 2 * n - 1; i++)
	{
		printf("%d\t%d\t%d\t%d\t%d\n", i, HT[i].weight, HT[i].parent, HT[i].lchild, HT[i].rchild);
	}
}

/******start******/

/******end******/