哈夫曼编码|数据结构

void CreateHuffmanCode(HuffmanTree HT,HuffmanCode &HC,int n)
{
	HC = new char*[n+1];
	cd = new char;
	cd[n-1]='\0';
	for(i=1;i<n;i++)
	{
		start=n-1;
		c=i;
		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;
}