1099 Build A Binary Search Tree（30 分）（C++）

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 Nlines 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

题目大意：建立一个BST，树的形状已经给定，求这棵树的层次遍历。

解题思路：将这串数字序列从小到大排序得到的是这棵BST的中序遍历，DFS可以建立该树。在建树的过程中直接进行层次遍历。

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int tree[105][2], n, cnt = 0;
vector<int>val, levelnum[105];
void dfs(int index, int level){
	if(index == -1)
		return;	
	dfs(tree[index][0], level + 1);
	levelnum[level].push_back(val[cnt ++]);
	dfs(tree[index][1], level + 1);
}
int main(){
	scanf("%d", &n);
	for(int i = 0; i < n; ++ i)
		scanf("%d %d", &tree[i][0], &tree[i][1]);
	val.resize(n);
	for(int i = 0; i < n; ++ i)
		scanf("%d", &val[i]);
	sort(val.begin(), val.end()); 
	dfs(0, 0);
	printf("%d", levelnum[0][0]);
	for(int i = 1; levelnum[i].size() != 0; ++ i)
		for(int j = 0; j < levelnum[i].size(); ++ j)
			printf(" %d", levelnum[i][j]);
}