hh.h

huffman树的建立文件

#define MAXBIT 40
#define MAXVALUE 10000
#define MAXLEAF 26
#define MAXNODE MAXLEAF*2-1
#include <stdio.h>
#include <iostream.h>
struct code{
	int bit[MAXBIT];
	int start;
};

struct node{
	int weight;
	int parent;
	int lchild;
	int rchild;
};


void HuffmanTree(node HuffNode[MAXNODE],int n)
{
	int i,j,m1,m2,x1,x2;
	for(i=0;i<2*n-1;i++)
	{
		HuffNode[i].weight=0;
		HuffNode[i].parent=-1;
		HuffNode[i].lchild=-1;
		HuffNode[i].rchild=-1;
	}
	for(i=0;i<n;i++)
	{
		printf("please input %d character's weight\n",i);
		scanf("%d",&HuffNode[i].weight);
	}
	for(i=0;i<n-1;i++)
	{
		m1=m2=MAXVALUE;
		x1=x2=0;
		for(j=0;j<n+i;j++)
		{
			if(HuffNode[j].weight<m1&&HuffNode[j].parent==-1)
			{m2=m1; x2=x1; m1=HuffNode[j].weight; x1=j;}
			else if(HuffNode[j].weight<m2&&HuffNode[j].parent==-1)
			{m2=HuffNode[j].weight; x2=j;}
		}
		HuffNode[x1].parent=n+i;
		HuffNode[x2].parent=n+i;
		HuffNode[n+i].weight=HuffNode[x1].weight+HuffNode[x2].weight;
		HuffNode[n+i].lchild=x1;
		HuffNode[n+i].rchild=x2;
	}
}


/*void HuffmanTree_d(node HuffNode[MAXNODE],int n)
{
	int i,j,m1,m2,x1,x2;
	for(i=0;i<2*n-1;i++)
	{
		HuffNode[i].weight=0;
		HuffNode[i].parent=-1;
		HuffNode[i].lchild=-1;
		HuffNode[i].rchild=-1;
	}


	char str[1000];
	for(i=0;i<1000;i++)
		str[i]=0;
	int pro[26],k=0;
	for(i=0;i<26;i++)
		pro[i]=0;
	cout<<"input a string less than 1000 char ended with a @:"<<endl;
	cin>>str[0];
	while(str[k] !='@'&& k<1000){ 
		
		pro[int(str[k])-97]=pro[int(str[k])-97]+1;
		k++;
		cin>>str[k];

	}
	for(i=0;i<n;i++)
		HuffNode[i].weight=pro[i];


	for(i=0;i<n-1;i++)
	{
		m1=m2=MAXVALUE;
		x1=x2=0;
		for(j=0;j<n+i;j++)
		{
			if(HuffNode[j].weight<m1&&HuffNode[j].parent==-1)
			{m2=m1; x2=x1; m1=HuffNode[j].weight; x1=j;}
			else if(HuffNode[j].weight<m2&&HuffNode[j].parent==-1)
			{m2=HuffNode[j].weight; x2=j;}
		}
		HuffNode[x1].parent=n+i;
		HuffNode[x2].parent=n+i;
		HuffNode[n+i].weight=HuffNode[x1].weight+HuffNode[x2].weight;
		HuffNode[n+i].lchild=x1;
		HuffNode[n+i].rchild=x2;
	}
}

*/