赫夫曼编码的存储表示和实现

⑴ 定义赫夫曼树和赫夫曼编码的存储表示  ⑵ 基于所设计的存储结构实现赫夫曼编码  ⑶ 编写主函数对所实现的赫夫曼编码进行测试 
1、采用书上第 147 页定义的赫夫曼树和赫夫曼编码的存储表示，编程实现从叶子到根逆向求赫夫曼编码和从根到叶子求赫夫曼编码。

例题一：

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef int Status;
typedef struct {
	unsigned int weight;
	unsigned int parent, lchild, rchild;
}HTNode, * HuffmanTree;
typedef char** HuffmanCode;
void Select(HuffmanTree HT, int u, int& s1, int& s2) {
	int j = 1;
	while (j <= u && HT[j].parent != 0)j++;
	s1 = j;
	while (j <= u) {
		if (HT[j].parent == 0 && HT[j].weight < HT[s1].weight)s1 = j;
		j++;
	}
	HT[s1].parent = u + 1;
	j = 1;
	while(j<=u && HT[j].parent!=0) j++;
	s2=j;
	while (j <= u) {
		if (HT[j].parent == 0 && HT[j].weight < HT[s2].weight)s2 = j;
		j++;
	}
	if (s1 > s2) {
		j = s1; s1 = s2; s2 = j;
	}
}
void HuffmanCoding(HuffmanTree &HT,HuffmanCode &HC,int *w,int n) {
	int i,j,m,s1,s2,start;
	char *cd;
	unsigned int c,f;
	if(n<=1) return;
	m=2*n-1;
	HT=(HuffmanTree)malloc((m+1)*sizeof(HTNode));
	for(i=1;i<=n;i++) {
		HT[i].weight=w[i-1];
		HT[i].parent=0;
		HT[i].lchild=0;
		HT[i].rchild=0;
	}
	for(i=n+1;i<=m;i++) {
		HT[i].weight=0;
		HT[i].parent=0;
		HT[i].lchild=0;
		HT[i].rchild=0;
	}
	printf("\n哈弗曼树的构造过程如下所示：\n");
	printf("HT初态:\n 结点 weight parent lchild rchild");
	for(i=1;i<=m;i++)
		printf("\n%4d%8d%8d%8d%8d",i,HT[i].weight,HT[i].parent,HT[i].lchild,HT[i].rchild);
	for(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("\nselect: s1=%d	s2=%d\n",s1,s2);
		printf(" 结点 weight parent lchild rchild");
		for(j=1;j<=i;j++)
			printf("\n%4d%8d%8d%8d%8d",j,HT[j].weight,HT[j].parent,HT[j].lchild,HT[j].rchild);
	}
	printf("\n");
	
	HC=(HuffmanCode)malloc((n+1)*sizeof(char*));
	cd=(char*)malloc(n*sizeof(char));
	cd[n-1]='\0';
	for(i=1;i<=n;++i) {
		start=n-1;
		for(c=i,f=HT[i].parent;f!=0;c=f,f=HT[f].parent)
			if(HT[f].lchild==c) cd[--start]='0';
			else cd[--start]='1';
		HC[i]=(char*)malloc((n-start)*sizeof(char));
		strcpy(HC[i],&cd[start]);
	}
	free(cd);
	printf("输出各结点的赫夫曼编码：\n");
	for(i=1;i<=n;i++)
		printf("%2d %s\n",i,HC[i]);
}
int main() {
	int w[] = { 5,29,7,8,14,23,3,11 }, n = 8;
	HuffmanTree HT;
	HuffmanCode HC;
	HuffmanCoding(HT, HC, w, n);
	return 0;
}