huffman 树

#include <stdio.h>
#define n 4
typedef struct  
{
    int parent;
    int lchild,rchild;
    int weight;
    int flag;
}Node;

typedef struct 
{
    char bit[n];
    int start;
    char ch;
}CodeNode;

Node haffman[7];
CodeNode code[n];

int select(int j)
{
    int i,position;
    int Min=100;
    for (i=0;i<=j;i++)
        if (haffman[i].weight<Min && haffman[i].flag==-1)
        {
            Min=haffman[i].weight;
            position=i;
        }
    haffman[position].flag=1;
    return position;
}

void haffmanCode()
{
    int i,j,p,k;
    
    for (i=0;i<n;i++)
    {
        printf("%d ",haffman[i].weight);
        code[i].start=n-1;
        j=i;
        p=haffman[i].parent;
        while (p!=-1)
        {
            if (haffman[p].lchild==j)
                code[i].bit[code[i].start]='0';   //左0右1;
            else
                code[i].bit[code[i].start]='1';
            code[i].start--;
            j=p;
            p=haffman[p].parent;
        }
        for(k=code[i].start+1 ;k<n ;k++)
          printf("%c",code[i].bit[k]);
        printf("\n");
    }

}

int main()
{
    
    int max=100 , i ;
    int m1,m2;

    //初始化节点数据;
    for (i=0;i<2*n-1;i++)
    {
        haffman[i].weight=0;
        haffman[i].parent=-1;
        haffman[i].lchild=-1;
        haffman[i].rchild=-1;
        haffman[i].flag=-1;
    }
    printf("请输入叶子节点的权值：");
    for (i=0;i<n;i++)
    {
        scanf("%d",&haffman[i].weight);   
    }
    //构造哈弗曼二叉树（n-1次合并）;
    for (i=n ; i<2*n-1 ;i++)
    {
        m1=select(i-1);        //最小权值位;
        m2=select(i-1);     //次最小权值;
        haffman[m1].parent=i;
        haffman[m2].parent=i;  //父节点在数组中的位置;
        haffman[i].weight=haffman[m1].weight+haffman[m2].weight;
        haffman[i].lchild=m1;
        haffman[i].rchild=m2;    //儿子节点在数组中的位置;
        
    }
    for (i=0 ;i<2*n-1 ;i++)
        printf("%d",haffman[i].weight);
    printf("\n");
    haffmanCode();
}