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<bits/stdc++.h>
using namespace std;
const int maxn = 105;
typedef struct node
{
    int data;
    int left;
    int right;
}Node;
Node Tree[maxn];
int Count=0;
int a[maxn];
void inorder(int i);
void cengxu(int root);
int n;
bool cmp(int a,int b)
{
    return a<b;
}
int main()
{
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>Tree[i].left>>Tree[i].right;
    }
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    sort(a,a+n,cmp);
    inorder(0);
    cengxu(0);
    return 0;
}
void inorder(int i)
{
    if(i<0||i>=n){
        return;
    }
    if(Tree[i].left!=-1){
        inorder(Tree[i].left);
    }
    Tree[i].data=a[Count++];
    if(Tree[i].right!=-1){
        inorder(Tree[i].right);
    }
}
void cengxu(int root)
{
    queue<int> q;
    q.push(root);
    int flag=0;
    while(!q.empty()){
        int temp = q.front();
        q.pop();
        if(flag==0){
            cout<<Tree[temp].data;
            flag=1;
        }else{
            cout<<" "<<Tree[temp].data;
        }
        if(Tree[temp].left!=-1){
            q.push(Tree[temp].left);
        }
        if(Tree[temp].right!=-1){
            q.push(Tree[temp].right);
        }
    }
}