哈夫曼编码译码

简单实现编码译码功能
打印哈夫曼树形 该怎么做呢 求教！

/*实现初始化，建立Huffman树，并完成字符的编码*/

/*	之前译码用for循环不能够重新复位遍历 while更好用
*/

#include "stdio.h"
#include "string.h"
#define N 10     //待编码字符的个数，即树中叶结点的最大个数
#define M 2*N-1  //树中总的结点数目
typedef struct{
	int weight;
	int parent,lchild,rchild;
}HTNode;  //树中结点的结构
typedef struct {
	char data;     //待编码的字符
	int weight;    //字符的权值
	char code[N];  //字符的编码
}HTCode;
void Init(HTCode hc[],int *n){
	/*初始化，读入待编码字符的个数n，从键盘输入n个字符和n个权值*/
	int i;
	printf("\ninput n=");
	scanf("%d",&(*n));
	printf("\ninput %d character: \n",*n);
	for(i=1;i<=*n;i++){
		while((hc[i].data=getchar())=='\n'&&(hc[i].data=getchar())==EOF);
	}
	printf("\ninput %d weight: \n",*n);
	for(i=1;i<=*n;i++) 
		scanf("%d",&(hc[i].weight));
}
void Select(HTNode ht[],int k,int *s1,int *s2){
	/*ht[1…k]中选择parent为0，并且weight最小的两个结点其序号由指针变量s1,s2指向*/
	int i;
	for(i=1;i<=k && ht[i].parent!=0 ;i++);
	*s1=i;
	for(i=1;i<=k;i++)
		if(ht[i].parent==0 && ht[i].weight<ht[*s1].weight) 
			*s1=i;
		for(i=1; i<=k; i++)
			if(ht[i].parent==0 && i!=*s1) 
				break;
			*s2=i;
			for (i=1;i<=k;i++)
				if(ht[i].parent==0 && i!=*s1 && ht[i].weight<ht[*s2].weight) 
					*s2=i;
}
void HuffmanCoding(HTNode ht[],HTCode hc[],int n){
	/*构造Huffman树ht，并求出n个字符的编码*/
	char cd[N];
	int i,m,c,f,s1,s2,start;
	m=2*n-1;
	for (i=1;i<=m;i++){
		if(i<=n)  
			ht[i].weight=hc[i].weight;
		else
			ht[i].weight=0;
		ht[i].parent=ht[i].lchild=ht[i].rchild=0;
	}
	for (i=n+1;i<=m;i++){
		Select(ht,i-1,&s1,&s2);
		ht[s1].parent=i;   
		ht[s2].parent=i;
		ht[i].lchild=s1;   
		ht[i].rchild=s2;
		ht[i].weight=ht[s1].weight+ht[s2].weight;
	}
	cd[n-1]='\0';
	for (i=1;i<=n;i++){
		start=n-1;
		for (c=i,f=ht[i].parent;f;c=f,f=ht[f].parent)
			if (ht[f].lchild==c) 
				cd[--start]='0';
			else 
				cd[--start]='1';
			strcpy(hc[i].code,&cd[start]);
	}
}

//译码
void Decode(HTNode ht[],HTCode hc[],int n){
	int i,j; 
	char b[20];
	j=0;
	i=2*n-1; 
	printf("输入编码(以'#'为结束标志):\n");  
	scanf("%s",b);
    printf("译码后的字符为:\n");  
	while(b[j]!='#'){
		if(b[j]=='0')
			i=ht[i].lchild;
		else  
		    i=ht[i].rchild;  
		if(ht[i].weight==hc[i].weight){  
		    printf("%c",hc[i].data);
			i=2*n-1;              //每次译码从头开始
		  }  
		 j++;  
	  }  
  printf("\n"); 
}

void main(){
	int i,n;
	HTNode ht[M+1];
	HTCode hc[N+1];
	Init(hc,&n);					//初始化
	HuffmanCoding(ht,hc,n);		//构造Huffman树，并形成字符的编码
	printf("\nHuffmanCode: \n");
	for(i=1;i<=n;i++)				//输出字符的编码
	printf("%c --- %s\n",hc[i].data,hc[i].code);
	printf("\n");

	Decode(ht,hc,n);

}