哈夫曼解压缩程序

#include "StdAfx.h"
#include "Hafuman.h"


Hafuman::Hafuman(void)
{
	//哈夫曼树初始化
	HTree=NULL;
	used=0;
	HuffNode htree[512];
	total=0;
	
	//每个叶子节点赋值
    for(int i=0;i<512;i++)
	{
		htree[i].count=0;
		htree[i].c=(unsigned char)i;
		htree[i].lchild=-1;
		htree[i].parent=-1;
		htree[i].rchild=-1;
	}
	HTree=htree;
}


Hafuman::~Hafuman(void)
{
}

HuffNode *Hafuman::GetHTree()
{
	return HTree;
}

int Hafuman::Getused()
{
	return used;
}

int Hafuman::Gettotal()
{
	return total;
}

void Hafuman::Set(char *infile)
{
	cout<<"***将被压缩的文件名提交给哈夫曼树"<<endl;
	infilename=infile;
	cout<<"***提交成功！"<<endl;
}

void Hafuman::Prepare()
{
	cout<<"***构建哈夫曼树之前的准备工作"<<endl;
	int i=0,j=0,k=0;
	HuffNode temp;
	FILE *infile;
	fopen_s(&infile,infilename,"rb");
	while(infile==NULL)
	{
		cout<<"要压缩的文件名有误！"<<endl;
		return;
	}
	//统计各个字符出现次数
	unsigned char c;
	while(!feof(infile))
	{
		fread(&c,1,1,infile);
		HTree[c].count++;
		total++;
	}
	total--;
	cout<<"***压缩前文件大小（即压缩前的文件的总字符个数） ："<<total<<endl;
	HTree[c].count--;

	//count为0的不要，按count从大到小排列
	for(i=0;i<255;i++)
	{
		for(j=i+1;j<256;j++)
		{
			if(HTree[i].count<HTree[j].count)
			{
				temp=HTree[i];
				HTree[i]=HTree[j];
				HTree[j]=temp;
			}
		}
	}

	//有用字符数
	for(i=0;i<512;i++)
	{
		if(HTree[i].count==0)
			break;
	}
	used=i;		//使用的字符数目，即可用的叶节点数目
	cout<<"***出现的字符种类：  "<<used<<endl;
	for(i=0;i<used;i++)
	{
		cout<<(unsigned int)HTree[i].c<<"号字符"<<"的权值（即出现次数）为："<<HTree[i].count<<endl;
	}
	fclose(infile);
	cout<<"***准备成功！"<<endl;

}

//构建哈夫曼树
void Hafuman::Great()
{
	cout<<"***创建哈夫曼树"<<endl;
	int i=0;
	int j=0;
	unsigned long min;
	int m=2*used-1;
	int pt=0;
	//每次从没有父节点的结点中找出权值最小的结点
	//连接到父节点上，父节点的权值位两节点的权值和
	//父节点的左子节点为权值最小的结点&#