PAT(二叉搜索树)——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.
Snip20160811_82

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

题目大意：

给出二叉搜索树的结构和所有的值，输出这些值组成二叉搜索树的层序遍历。

题目解析：

类似于1064题的思路，由给定的值序列，从小到大排列得到二叉搜索树的中序遍历序列，然后填入给定的结构即可。

具体代码：

#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
#define MAXN 1005

struct node{
	int value;
	int left=-1;
	int right=-1;
}ans[MAXN];
int n,index=0;
int list[MAXN];

void create(int root){
	if(root!=-1&&root<n){
		create(ans[root].left);
		ans[root].value=list[index++];
		create(ans[root].right);
	}
}
void level(){
	queue<int> q;
	q.push(0);
	while(!q.empty()){
		int tmp=q.front();q.pop();
		if(tmp==-1) continue;
		if(tmp==0)
			cout<<ans[tmp].value;
		else
			cout<<" "<<ans[tmp].value;
		q.push(ans[tmp].left);
		q.push(ans[tmp].right);
	}
}
int main()
{
    cin>>n;
    for(int i=0;i<n;i++)
    	cin>>ans[i].left>>ans[i].right;
    for(int i=0;i<n;i++)
    	cin>>list[i];
    sort(list,list+n);
    create(0);
	level();
    return 0;
}