1099 Build A Binary Search Tree (30 分)

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<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int N=110;
int n;
struct node{
    int val;
    node *r;
    node *l;
};
node rec[N];
vector<int> res;
vector<int> s;
int idx=0;
queue<node> ans;
void dfs(node *root){
    if(root->l!=NULL){
        dfs(root->l);
    }
    root->val=res[idx++];
    if(root->r!=NULL){
        dfs(root->r);
    }
}


int main(){
    cin >> n;
    for(int i=0;i<n;i++){
        int a,b;
        cin >> a >> b;
        if(a!=-1)
            rec[i].l=&rec[a];
        else
            rec[i].l=NULL;
        if(b!=-1)
            rec[i].r=&rec[b];
        else
            rec[i].r=NULL;
    }
    for(int i=0;i<n;i++){
        int t;
        cin >> t;
        res.push_back(t);
    }
    sort(res.begin(),res.end());
    dfs(&rec[0]);
    ans.push(rec[0]);
    s.push_back(rec[0].val);
    while(ans.size()){
        node t=ans.front();
        if(t.l!=NULL)
        {
            ans.push(*t.l);
            s.push_back((*t.l).val);
        }
        if(t.r!=NULL){
            ans.push(*t.r);
            s.push_back((*t.r).val);
        }
        ans.pop();
    }
    for(int i=0;i<n;i++){
        if(i!=0)
            printf(" ");
        printf("%d",s[i]);
    }
    return 0;
}