1099. Build A Binary Search Tree (30) 给定二叉搜索树插值

题目链接:<a target=_blank href="https://www.patest.cn/contests/pat-a-practise/1099" target="_blank">https://www.patest.cn/contests/pat-a-practise/1099</a>

#include <iostream>
#include <string>
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
#include <stack>
using namespace std;
struct Node
{
int number,leftNum,rightNum;
Node *left,*right;
Node():number(0),leftNum(0),rightNum(0),left(NULL),right(NULL){};
};
int calcLeftNodeNum(Node * T)
{
if(T==NULL)
return 0;
T->leftNum = calcLeftNodeNum(T->left);
T->rightNum = calcLeftNodeNum(T->right);
return T->leftNum + T->rightNum+1;
}
void setNum(Node *T,int start,vector<int> target){
if(T==NULL)
return;
T->number = target[start+T->leftNum];
setNum(T->left,start,target);
setNum(T->right,start+T->leftNum+1,target);
}
int main()
{
int n,l,r;
scanf("%d",&n);
vector<Node*>BST;
for (int i=0; i<n; ++i) {
BST.push_back(new Node());
}
for(int i=0; i<n; ++i)
{
scanf("%d %d",&l,&r);
if(l!=-1)
BST[i]->left = BST[l];
else
BST[i]->left = NULL;
if(r!=-1)
BST[i]->right = BST[r];
else
BST[i]->right = NULL;
}
vector<int>target(n);
for (int i=0; i<n; ++i)
scanf("%d",&target[i]);
sort(target.begin(), target.end());
Node * root = BST[0];
calcLeftNodeNum(root);
setNum(root,0,target);
target.clear();
queue<Node *>q;
if(root)
q.push(root);
while (!q.empty()) {
Node * p = q.front();
q.pop();
target.push_back(p->number);
if(p->left)
q.push(p->left);
if(p->right)
q.push(p->right);
}
for(int i=0;i<n;++i)
printf(i==n-1?"%d\n":"%d ",target[i]);
return 0;
}