PAT甲级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

 

      题目大意：

         给定n个结点的BST，并且随后n行给出的是第i个结点的左孩子与右孩子的下标。最后给定n个整数，求该BST的层序遍历。

 

 

思路：

         静态二叉树，且BST中序遍历便是从小到大的排序。填完以后BFS一遍即可。

    由于是固定了树的形态，BST也是唯一固定下来了。另外的考法最多就是给定除了中序以外的序列，让你去建BST。否则BST形态不唯一。

 

 

参考代码：

 

 

#include<vector>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
struct node{
	int l, r, v;
};
int n, idx;
vector<node> t;
vector<int> list, inq;
void inorder(int v){
	if(v == -1)	return;
	inorder(t[v].l);
	t[v].v = list[idx++];
	inorder(t[v].r);
}
int main(){
	scanf("%d", &n);
	t.resize(n), list.resize(n), inq.resize(n);
	for(int i = 0; i < n; ++i)	scanf("%d%d", &t[i].l, &t[i].r);
	for(int i = 0; i < n; ++i)	scanf("%d", &list[i]);
	sort(list.begin(), list.end());
	inorder(0);
	queue<node> q;
	q.push(t[0]);
	inq[0] = 1; 
	int flag = 0;
	while(!q.empty()){
		node top = q.front(); q.pop();
		int l = top.l, r = top.r;
		if(!flag) printf("%d", top.v), flag++;
		else	printf(" %d", top.v);
		if(l!= -1)	q.push(t[l]), inq[l] = 1;
		if(r != -1)	q.push(t[r]), inq[r] = 1;
	}
}