PTA 甲级 1099 Build A Binary Search Tree (30分)

A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:

• The left subtree of a node contains only nodes with keys less than the node's key.
• The right subtree of a node contains only nodes with keys greater than or equal to the node's key.
• Both the left and right subtrees must also be binary search trees.

Given the structure of a binary tree and a sequence of distinct integer keys, there is only one way to fill these keys into the tree so that the resulting tree satisfies the definition of a BST. You are supposed to output the level order traversal sequence of that tree. The sample is illustrated by Figure 1 and 2.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤100) which is the total number of nodes in the tree. The next N lines each contains the left and the right children of a node in the format left_index right_index, provided that the nodes are numbered from 0 to N−1, and 0 is always the root. If one child is missing, then −1 will represent the NULL child pointer. Finally N distinct integer keys are given in the last line.

Output Specification:

For each test case, print in one line the level order traversal sequence of that tree. All the numbers must be separated by a space, with no extra space at the end of the line.

Sample Input:

9
1 6
2 3
-1 -1
-1 4
5 -1
-1 -1
7 -1
-1 8
-1 -1
73 45 11 58 82 25 67 38 42

Sample Output:

58 25 82 11 38 67 45 73 42

题目大意: 给了一棵已经构造完成的有n个结点的二叉树和n个数字,让把这n个数字放入二叉树中使得二叉树变成一个二叉搜索树. 、
最后输出二叉搜索树的层序遍历,且固定给定二叉树的根节点是结点0

#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
int a[110];
int idx;
struct node{
    int val;
    int left;
    int right;
}nodes[110];
vector<int> vect;

void inorder(int root){   // 二叉搜索树的中序遍历是个有序序列,通过中序遍历,将各个结点的值放入结点中
    if (root == -1) return;
    inorder(nodes[root].left);
    nodes[root].val = a[idx++];
    inorder(nodes[root].right);
}

void bfs(){
    queue<int> q;
    q.push(0);
    while(!q.empty()){
        int t = q.front();
        q.pop();
        vect.push_back(nodes[t].val);
        if (nodes[t].left != -1) q.push(nodes[t].left);
        if (nodes[t].right != -1) q.push(nodes[t].right);
    }
}

int main(){
    int n,num1,num2;
    cin>>n;
    for (int i = 0; i < n; ++i){
        scanf("%d%d",&num1,&num2);
        nodes[i].left = num1;
        nodes[i].right = num2;
    }
    for (int i = 0; i < n; ++i)
        cin>>a[i]; 
    sort(a, a + n);   // 二叉搜索树的中序遍历是一个有序序列
    inorder(0);
    bfs();
    for (int i = 0; i < vect.size(); ++i){
        if (i) cout<<" "<<vect[i];
        else cout<<vect[i];
    }
    return 0;
}