哈夫曼编码的设计

给定若干权值，建立哈夫曼树，并进行编码，将编码输出。给出一段明文，设计程序将明文经过编码形成密文，再设计程序将密文翻译成明文

#include<stdio.h>
#include<conio.h>
#define MAXVALUE 10000
#define MAXLEAF 30
#define MAXNODE MAXLEAF*2-1
#define MAXBIT 50
#define NULL 0
typedef struct node{
	char letter;
	    int weight;
		int parent;
		int lchild;
		int rchild;
}HNodeType;
typedef struct {
	char letter;
	   int bit[MAXBIT];
	   int start;
}HCodeType;
typedef struct{
	char s;
	     int num;
}Message;
void HuffmanTree(HNodeType HuffNode[],int n,Message a[])
{
	int i,j,m1,m2,x1,x2,temp1;char temp2;
	for(i=0;i<2*n-1;i++)
	{
		HuffNode[i].letter=NULL;
		HuffNode[i].weight=0;
		HuffNode[i].parent=-1;
		HuffNode[i].lchild=-1;
		HuffNode[i].rchild=-1;
	}
	for(i=0;i<n-1;i++)
		for(j=i+1;j<n-1;j++)
			if(a[j].num>a[i].num)
			{
				temp1=a[i].num;a[i].num=a