ss.cpp

huffman树的建立文件

#include "hh.h"
#include <stdio.h>
#include <iostream.h>
void main()
{
	node HuffNode[MAXNODE];
	code HuffCode[MAXLEAF],cd;
	int i,j,c,p,n=26;
	
	HuffmanTree(HuffNode,n);
	for(i=0;i<n;i++)
	{
		cd.start=n-1;
		c=i;
		p=HuffNode[c].parent;
		while(p!=-1)
		{ if(HuffNode[p].lchild==c) cd.bit[cd.start]=0;
		else cd.bit[cd.start]=1;
		cd.start--; c=p;
		p=HuffNode[c].parent;
		}
		for(j=cd.start+1;j<n;j++)
			HuffCode[i].bit[j]=cd.bit[j];
		HuffCode[i].start=cd.start;
	}
	for(i=0;i<n;i++)
	{
		printf("%d character is:",i);
		for(j=HuffCode[i].start+1;j<n;j++)
			printf("%d",HuffCode[i].bit[j]);
		printf("\n");
	}


/*	HuffmanTree_d(HuffNode,n);
	for(i=0;i<n;i++)
	{
		cd.start=n-1;
		c=i;
		p=HuffNode[c].parent;
		while(p!=-1)
		{ if(HuffNode[p].lchild==c) cd.bit[cd.start]=0;
		else cd.bit[cd.start]=1;
		cd.start--; c=p;
		p=HuffNode[c].parent;
		}
		for(j=cd.start+1;j<n;j++)
			HuffCode[i].bit[j]=cd.bit[j];
		HuffCode[i].start=cd.start;
	}
	for(i=0;i<n;i++)
	{
		printf("%d character is:",i);
		for(j=HuffCode[i].start+1;j<n;j++)
			printf("%d",HuffCode[i].bit[j]);
		printf("\n");
	}
*/

}