数据结构选做实验项目 哈夫曼树

已知字母A,B,C,D,E,F,G的权值：3，45，23，12，8，33，25，编写程序构造其对应的哈夫曼树，并输出每个字母的哈夫曼编码.

#include<iostream>
#include<string.h>
using namespace std;

//哈夫曼树结点结构
typedef struct 
{
	string name;//节点名称 
	int weight;//结点权重
	int parent, lchild, rchild;//父结点、左孩子、右孩子在数组中的位置下标
}HTNode, *HuffmanTree;

typedef char **HuffmanCode;


void Select(HuffmanTree HT, int end, int *s1, int *s2)
{
	int min1, min2;
	int i = 1;
	while(HT[i].parent != 0 && i <= end) i++;
	min1 = HT[i].weight;
	*s1 = i;
	i++;
	while(HT[i].parent != 0 && i <= end) i++;
	if(HT[i].weight < min1)
	{
		min2 = min1;
		*s2 = *s1;
		min1 = HT[i].weight;
		*s1 = i;
	}
	else
	{
		min2 = HT[i].weight;
		*s2 = i;
	}
	for(int j = i + 1; j <= end; j++)
	{
		if(HT[j].parent != 0) continue;
		if(HT[j].weight < min1)
		{
			min2 = min1;
			min1 = HT[j].weight;
			*s2 = *s1;
			*s1 = j;
		}
		else if(HT[j].weight >= min1 && HT[j].weight < min2)
		{
			min2 = HT[j].weight;
			*s2 = j;
		}
	}
}


void CreateHuffmanTree(HuffmanTree &HT, int n)
{
	if(n <= 1) return;
	int m = 2 * n - 1;
	HT = new HTNode[m+1];
	for(int i=1; i<m; i++)
	{
		HT[i].parent = 0;
		HT[i].lchild = 0;
		HT[i].rchild = 0;
	}
	for(int i=1; i<=n; i++)
		cin>>HT[i].name>>HT[i].weight;
	for(int i=n+1; i<=m; i++)
	{
		int s1, s2;
		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;
	}		
}


void CreatHuffmanCode(HuffmanTree HT,HuffmanCode &HC,int n)
{
	HC = new char*[n+1];
    char *cd = new char[n];
	cd[n-1] = '\0';
	for(int i=1; i<=n; i++)
	{
		int start = n-1;
		int c = i;
		int f = HT[i].parent;
		while(f != 0)
		{
			--start;
			if(HT[f].lchild == c) cd[start] = '0';
			else cd[start] = '1';
			c = f;
			f = HT[f].parent;
		}
		HC[i] = new char[n - start];
		strcpy(HC[i], &cd[start]);
	}	
	delete cd;
} 


int main()
{
	HuffmanTree HT;
	int n;
	puts("请输入节点个数:"); 
	cin>>n;
	puts("请输入节点名称及权值(用空格隔开)"); 
	CreateHuffmanTree(HT, n);
	HuffmanCode HC;
	CreatHuffmanCode(HT, HC, n);
	puts("每个字母的哈夫曼编码");
	for(int i=1; i<=n; i++)
		cout<<HT[i].name<<' '<<HC[i]<<endl; 
	return 0;
}