哈夫曼树及其应用

#include<iostream>
#pragma warning(disable:4996)
using namespace std;
//哈夫曼树构造算法的实现
typedef struct 
{
	int weight;
	int parent, lch, rch;
}htnode,*huffmantree;
void select(huffmantree ht, int max, int& s1, int& s2)
{
	int ban=99999;
	for (int i = 1;i <= max;i++)
	{
		if (ht[i].parent != 0)
		{
			continue;
		}
		else
		{
			if (ht[i].weight <= ban)
			{
				ban = ht[i].weight;
				s1 = i;
			}
		}
	}
	ban = 99999;
	for (int i = 1;i <= max;i++)
	{
		if (ht[i].parent != 0 || i == s1)
		{
			continue;
		}
		else
		{
			if (ht[i].weight <= ban)
			{
				ban = ht[i].weight;
				s2 = i;
			}
		}
	}
}
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].lch = 0;
		ht[i].rch = 0;
		ht[i].parent = 0;
	}
	for (int i = 1;i <= n;i++)
	{
		cin >> ht[i].weight;
	}
	for (int i = n + 1;i <= m;i++)
	{
		int s1, s2;
		select(ht, i - 1, s1, s2);
		ht[i].lch = s1;
		ht[i].rch = s2;
		ht[i].weight = ht[s1].weight + ht[s2].weight;
		ht[s1].parent = i;
		ht[s2].parent = i;
	}
}
void createhuffmancode(huffmantree ht, char**& hc, int n)//共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].lch == 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]);//一直是要带结束字符'\0'的,用这个函数的时候也是用这个作为终止条件
	}
		delete[]cd;
}





int main()
{
	huffmantree t;
	char** s;
	createhuffmantree(t, 8);
	createhuffmancode(t, s, 8);
	cout << s[3] << endl;
	return 0;
}