C++实现哈弗曼编码与解码

#include <iostream>
#include<string>
using namespace std;
#define max 100

char cha[max],string1[max];
char Hcode[max-1][max];
struct huftree                                              //Huffmanman节点存储结构
{
     unsigned int weight;
     unsigned int LChild;
     unsigned int RChild;
 unsigned int parent;
};
class Huffman
{
public:
void SelectMin(huftree tree[],int k);                   //权值最小的两个节点
    void Huffmanman(huftree tree[],int *w,int n);              //生成Huffmanman树
    void CreateTable(huftree tree[],char code[],int n,int len[],int weight[],int length1);     //生成哈夫曼编码
    void Encode(int n);                                     //将从键盘上接收的字符转变为哈夫曼编码
    void decode(char ch[],huftree tree[],int n);            //将从键盘上接收的二进制码解码为字符
private:
int min1;
int min2;
};
void Huffman::SelectMin(huftree tree[],int k)                  //找出权值最小的两个节点
{
    int i;
    for (i=1;i<=k && tree[i].parent!=0 ;i++); 

      min1=i;
    for (i=1;i<=k;i++)
        if (tree[i].parent==0 && tree[i].weight<tree[min1].weight) 
min1=i;
        tree[i].weight=max;
    for (i=1;i<=k;i++)
        if (tree[i].parent==0 && i!=min1) 
break; 
min2=i;
    for (i=1;i<=k;i++)
        if ( tree[i].parent==0 && i!=min1 && tree[i].weight<tree[min2].weight)
min2=i;
tree[i].weight=max;
}

void Huffman::Huffmanman(huftree tree[],int *w,int n)              //生成Huffmanman树
{  
int m,i;
    if (n<=1)
return;
    m=2*n-1;
    for (i=1;i<=n;i++)
    { 
tree[i].weight=w[i]; 
        tree[i].parent=0;
        tree[i].LChild=0;   
        tree[i].RChild=0; 
}
    for (i=n+1;i<=m;i++)
    {