构造哈夫曼树

#include<iostream>
using namespace std;
int i,j,s1,s2,t,a[10];
int max=1000;
typedef struct {
	int weight;
	int parent,lchild,rchild;
} HTNode,*Huffmantree;
void select(Huffmantree HT,int n, int &s1, int &s2)
{
    for (int i = 1; i <= n; i++)
    {
        if (HT[i].parent == 0)// 初始化s1,s1的双亲为-1
        {
            s1 = i;
            break;
        }
    }
    for (int i = 1; i <= n; i++)// s1为权值最小的下标
    {
        if (HT[i].parent == 0 && HT[s1].weight > HT[i].weight)
            s1 = i;
    }
    for (int j = 1; j <= n; j++)
    {
        if (HT[j].parent == 0&&j!=s1)// 初始化s2,s2的双亲为-1
        {
            s2 = j;
            break;
        }
    }
    for (int j = 1; j <= n; j++)// s2为另一个权值最小的结点
    {
        if (HT[j].parent == 0 && HT[s2].weight > HT[j].weight&&j != s1)
            s2 = j;
    }
}
void creatHuffmantree(Huffmantree &HT,int n) {
	int m=2*n-1;
	HT=new HTNode[m+1];
	for( i=1; i<=m; i++) {
		HT[i].lchild=0;
		HT[i].rchild=0;
		HT[i].parent=0;
	}
	for( j=1; j<=n; j++)
		cin>>HT[j].weight;
	for( i=n+1; i<=m; i++) {
		select(HT,i-1,s1,s2);          //找到双亲为0并且权值最小的两个结点，返回序号s1,s2
		HT[s1].parent=i;
		HT[s2].parent=i;
		HT[i].lchild=s1;
		HT[i].rchild=s2;
		HT[i].weight=HT[s1].weight+HT[s2].weight;
		HT[i].parent=0;
		//printf("%d %d\n",s1,s2); 
		//printf("%d\n",HT[i].weight);
	}
}

int main() {
	Huffmantree HT;
	int n;
	cin>>n;
	creatHuffmantree(HT,n);
//	printf("%d\n",HT[2*n-1]);
for(i=1;i<=2*n-1;i++)
{
	//printf("%d %d\n",s1,s2);
    printf("%d ",HT[i].weight);
}
printf("\n");
}