1099 Build A Binary Search Tree (30 分)——甲级：建树，输出层序（二叉搜索树）

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

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

题目大意：结点从0到n-1编号，0总为根节点。给出每个结点的孩子结点情况，最后给出每个结点的键值，通过这个序列构造BST，然后输出层序。
思路：根据BST的特点，这个序列从小到大的顺序就是中序遍历的结果。那么在中序遍历的时候，把键值存入树中，最后BFS层序输出即可。

代码如下:

#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
struct node
{
    int data;
    int left;
    int right;
}a[100];
int b[100], index;
void build(int n)
{
    int i;
    for(i = 0; i < n; i++)
    {
        int l, r;
        cin >> l >> r;
        a[i].left = l;
        a[i].right = r;
    }
}
void inorder(int t)
{
    if(t == -1) return ;
    inorder(a[t].left);
    a[t].data = b[index++];//把序列的值在中序遍历的过程中存入树中
    inorder(a[t].right);
}
void bfs(int root, int n)
{
    queue<int>q;
    q.push(root);
    int cnt = 0;
    while(!q.empty())
    {
        int x = q.front();
        cnt++;
        if(cnt == n) cout << a[x].data << endl;
        else cout << a[x].data << " ";
        if(a[x].left != -1) q.push(a[x].left);
        if(a[x].right != -1) q.push(a[x].right);
        q.pop();
    }
}
int main()
{
    int n, i;
    cin >> n;
    build(n);
    for(i = 0; i < n; i++) cin >> b[i];
    sort(b, b+n);
    inorder(0);
    bfs(0, n);
    return 0;
}

总结

把BST中的键值从小到大排就是这棵树中序遍历的结果，这是一个很好的特性。