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

#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
#define maxn 110
int a[maxn],cnt=0,n;
struct tree{
    int num,l,r;
    tree(){
        l=r=-1;
    }
}tr[maxn];
void inorder(int t){
    if(t!=-1){
        inorder(tr[t].l);
        tr[t].num=a[cnt];
        cnt++;
        inorder(tr[t].r);
    }
}
int main(){
    freopen("in.txt","r",stdin);
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d%d",&tr[i].l,&tr[i].r);
    }
    queue <int> q;
    for(int i=0;i<n;i++){
        scanf("%d",&a[i]);
    }
    sort(a,a+n);
    cnt=0;
    inorder(0);
    printf("%d",tr[0].num);
    q.push(0);
    while(!q.empty()){
        int t=q.front();
        q.pop();
        if(tr[t].l!=-1){
            q.push(tr[t].l);
            printf(" %d",tr[tr[t].l].num);
        }
        if(tr[t].r!=-1){
            q.push(tr[t].r);
            printf(" %d",tr[tr[t].r].num);
        }
    }
    return 0;
}