#include<iostream>
using namespace std;
struct Tpoint {
int weight;
int lchild;
int rchild;
int parent;
};
void INIT(Tpoint* T,int n) { //初始化哈夫曼树
for (int i = 1; i <= 2 * n - 1; i++) {
T[i].lchild = 0;
T[i].rchild = 0;
T[i].parent = 0;
}
int weight;
for (int i = 1; i <= n; i++) {
cin >> weight;
T[i].weight = weight;
}
}
void Show(Tpoint* T,int n) { //展示二叉树
for (int i = 1; i <= 2 * n - 1; i++) {
cout<< i<<"\t"<<T[i].weight <<"\t" << T[i].parent << "\t" << T[i].lchild << "\t" << T[i].rchild << endl;
}
}
voi