哈夫曼树的有序构建

#include<stdio.h>
#include<iostream>
#include<string.h>
#define MAX_TREE_SIZE 100
using namespace std;

typedef struct 
{
	int wight, parent, Lchild,Rchild;

}HTnode,*Hfmtree;


void slect(Hfmtree &HT,int n,int &s1,int &s2)
{	s1=0;s2=0;
	int mine1=999,mine2=999;

	
	for(int i=1;i<=n;i++)
	{	
		if((mine1>HT[i].wight)&&HT[i].parent==0)                
		{
			mine1=HT[i].wight;
			s1=i;
		}
	}

	for(int i1=1;i1<=n;i1++)
	{		if((mine2>HT[i1].wight)&&HT[i1].parent==0&&i1!=s1)
				{
					mine2=HT[i1].wight;
					s2=i1;
				}
	
	}
	//return s1,s2;	
}

void Creathfmtree(Hfmtree&HT,int n)//n=8
{
	int m,s1,s2 ,data[8];
	if(n<1)return ;
	m=2*n-1;                   //m=15
	HT=new HTnode[m+1];          //第一个格不用共开辟1~16个
	for(int i=1;i<=m+1;i++)
	{
		HT[i].parent=0;
		HT[i].Lchild=0;
		HT[i].Rchild=0;
		HT[i].flag=0;
	}
	
	data[0]=5;
	data[1]=29;
	data[2]=7;
	data[3]=8;
	data[4]=14;
	data[5]=23;
	data[6]=3;
	data[7]=11;
	for(int a=0;a<n;a++)
		HT[a+1].wight=data[a];
	


	for(int i1=n+1;i1<=2*n-1;i1++)
	{
		slect(HT,i1-1,s1,s2);

		HT[s1].parent=i1;
		HT[s2].parent=i1;
		HT[i1].Lchild=s1;
		HT[i1].Rchild=s2;
		HT[i1].wight=HT[s1].wight+HT[s2].wight;	
	}
}


void print1(Hfmtree &HT,int n)
{
	cout<<"结点i"<<"\t"<<"weight"<<"\t"<<"parent"<<"\t"<<"Lchild"<<"\t"<<"Rchild"<<endl;
	for(int i=1;i<=2*n-1;i++)
	{
		cout<<i<<"\t"<<HT[i].wight<<"\t"<<HT[i].parent<<"\t"<<HT[i].Lchild<<"\t"<<HT[i].Rchild<<endl;
	}

}

void main()
{
	int n;
	Hfmtree HT;
	cout<<"创建哈夫曼树"<<endl;
	cout<<"请输入叶子结点数:";
	cin>>n;
	Creathfmtree(HT,n);//n=8
	cout<<"打印哈夫曼树表"<<endl;
	

各位如果看到了，帮个忙，我用for循环cin直接输1到9的权值就出错，但用数组赋值就不会报错，懂的大神，帮忙解答一下，谢谢