我写了个huffman树的c程序,但是结果却不对:(

程序如下:
#include<stdio.h>
typedef struct
{ int weight;
int lchild,rchild,parent;
}HTNode;
typedef HTNode HuffmanTree[200];

void InitHuffman(HuffmanTree T,int m)
{ int i;
for(i= 0 ;i<m;i++)
{ T[i].weight=0;
T[i].lchild=T[i].rchild=T[i].parent=-1;
}
}
void Inputweight(HuffmanTree T,int n)
{ int i,w;
printf("Input weight:\n");
for(i = 0;i<n;i++)
{ scanf("%d",&w);
T[i].weight=w;
}
}

void SelectMin(HuffmanTree T,int n,int *p1,int *p2)
{ int i;
*p1=*p2=0;
for(i =1;i<=n;i++)
if((T[i].weight<T[*p1].weight)&&(T[i].parent==-1)) *p1=i;
for(i = 1;i<=n;i++)
if((i!=*p1)&&(T[i].weight<T[*p2].weight)&&(T[i].parent==-1))
*p2=i;

}
void CreateHuffman(HuffmanTree T,int n,int m)
{ int i,p1,p2;
InitHuffman(T,m);
Inputweight(T,n);
for(i = n;i<m;i++)
{ SelectMin(T,i-1,&p1,&p2);
{ T[p1].parent=T[p2].parent=i;
T[i].lchild=p1;
T[i].rchild=p2;
T[i].parent=-1;
T[i].weight=T[p1].weight+T[p2].weight;
}
}
}
main()
{ HuffmanTree T;
int i,n;
printf("Input n:\n");
scanf("%d",&n);
CreateHuffman(T,n,2*n-1);
printf("Output:\n");
printf("T[i] weight lchild rchild parent\n");
for(i = 0;i<2*n-1;i++)
{ printf("%-10d",i);
printf("%-10d",T[i].weight);
printf("%-10d%-10d",T[i].lchild,T[i].rchild);
printf("%-10d",T[i].parent);
printf("\n");
}
}


编译时能通过,但是结果不对,希望高手指点------只要能解决,一定给分