哈夫曼树建立 皇星客栈

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#define MAXVALUE 100                //定义最大权值
#define MAXLEAF 50                  //定义哈夫曼树中叶子节点个数
#define MAXNODE MAXLEAF*2-1

typedef struct{
    int weight;
    int parent;
    int lchild;
    int rchild;
    }HNodeType;
    
static int n; 

HNodeType HuffNode[MAXNODE];
HNodeType *HaffmanTree( ){
    int i,j,m1,m2,x1,x2;
    scanf("%d",&n);                     //输入叶子节点个数
    for(i=0;i<2*n-1;i++)          //数组HuffNode[ ]初始化
    {
        HuffNode[i].weight=0;
        HuffNode[i].parent=-1;
        HuffNode[i].lchild=-1;
        HuffNode[i].rchild=-1;
    }
    for(i=0;i<n;i++)
            scanf("%d", &( HuffNode[i].weight));
    for(i = 0 ; i < n - 1 ; i++ ) {
     m1=m2=MAXVALUE;
     x1 = x2 = 0;
     for( j=0 ; j < n + i ; j++ )  
     {
         if(HuffNode[j].parent == -1 && HuffNode[j].weight < m1)
         {   
             m2 = m1;
             x2 = x1;
             m1 = HuffNode[j].weight;
             x1 = j;
         }
         else
            if(HuffNode[j].parent == -1 && HuffNode[j].weight < m2 ){
               m2 = HuffNode[j].weight;                                                                            
               x2 = j;
            }
    }
    HuffNode[x1].parent = n + i;
    HuffNode[x2].parent = n + i;
    HuffNode[n+i].weight = HuffNode[x1].weight + HuffNode[x2].weight;
    HuffNode[n+i].lchild = x1;
    HuffNode[n+i].rchild = x2;
  }
  return HuffNode;
}

int main( )
{
     HaffmanTree( );
     for(int i=0; i < 2*n-1 ; i++)
     {
         printf("%d ",HuffNode[i].weight);
         printf("%d ",HuffNode[i].lchild);
         printf("%d ",HuffNode[i].rchild);
         printf("%d",HuffNode[i].parent);
         printf("\n");
     }
     return 0;
}