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.

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

思路：

1. 先建立树的结构，统计根节点左子树结点个数以及右子树结点个数

2. 对给定的序列进行排序，然找到根节点，然后进行建树，进行层序输出。 

好吧，我的思路错了，折腾了好久想简单了...而且二叉搜索树的中序遍历性质也没记起来！导致进入死胡同！！！！！

 

 

 

柳神代码：

1.结构体存储树的结构

2.  a数组存树的信息，b数组存树节点的所有data

3. 二叉搜索树性质：中序遍历树得到的结点顺序是 数值序列从小到大的排列顺序！！！把数值序列排序后，在中序遍历的时候直接赋值当前a[root].data

4. 根据节点的层数和下标，排序输出层序

#include <iostream>
#include <vector>
using namespace std;
struct node{
	int data, index, left, right, level;
}a[105];
int n, cnt= 0, b[105];
bool cmp(node a, node b){
	if (a.level != b.level) return a.level < b.level;
	return a.index < b.index;
}
void dfs(int root, int index, int level){
	if(a[root].left == -1 && a[root].right == -1){
		a[root].data = b[cnt++];
		a[root].index = index;
		a[root].level = level;
	}else {
		if (a[root].left != -1) dfs(a[root].left, index * 2 + 1, level + 1);
		a[root].data = b[cnt++];
		a[root].index = index;
		a[root].level = level;
		if (a[root].right != -1) dfs(a[root].right, index * 2 + 2, level + 1);
	}	
}
int main(){
	scanf("%d", &n);
	for(int i = 0; i < n; i++){
		cin >> a[i].left >> a[i].right;
	}
	for(int i = 0; i < n; i++) cin >> b[i];
	sort(b,b+n);
	dfs(0,0,0);
	sort(a, a+n,cmp);
	for (int i = 0; i < n; i++) {
		if (i != 0) cout << " ";
		cout << a[i].data;
	}
	return 0;
}