HuffmanTree的创建问题

#include <stdio.h>
#include <string.h>
#include <malloc.h>

typedef struct
{   
     int weight;         // 结点权值?   
     int parent, lc, rc; // 双亲结点和左 右子节点
} HTNode, *HuffmanTree;

void Select(HuffmanTree *HT, int n, int *s1, int *s2)
{   
    int minum,i;      // 定义一个临时变量保存最小值?   
    for(i=1; i<=n; i++)     // 以下是找到第一个最小值   
    {      
         if((*HT)[i].parent == 0)        
   
            {   
                minum = i;            
                 break;        
            }   
     }   
    for(i=1; i<=n; i++)   
         {      
             if((*HT)[i].parent == 0)           
                 if((*HT)[i].weight < (*HT)[minum].weight)               
                     minum = i;   
        }
         
*s1 = minum;    // 以下是找到第二个最小值，且与第一个不同  
  
    for( i=1; i<=n; i++)         
        {      
            if((*HT)[i].parent == 0 && i != *s1)        
                {   
                    minum = i;            
                     break;        
                }   
        }   
    for( i=1; i<=n; i++)   
         {        
                 if((*HT)[i].parent == 0 && i != *s1)           
                      if((*HT)[i].weight < (*HT)[minum].weight)               
                          minum = i;   
        }
           
*s2 = minum;

}
void CreatHuff(HuffmanTree *HT, int *w, int n);
int main()
{   
    HuffmanTree HT;        
    int *w, n, wei,i;   
    //printf("input the number of node\n");   
    scanf("%d", &n);   
    //w = new int[n+1];   
    w=(int *) malloc ((n+1) * sizeof(int));
    //printf("\ninput the %dth node of value\n", n);     
    for(i=1; i<=n; i++)   
    {        
        scanf("%d", &wei);        
        w[i] = wei;    }   
    CreatHuff(&HT, w, n);      
    return 0;
}
/*填写代码区*/