PAT甲级-1099-Build A Binary Search Tree(二叉搜索树的填充式建立+中序+层序遍历)

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 or equal to the node’s key.
• The right subtree of a node contains only nodes with keys greater than 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

key points：

将关键字按从小到大的顺序排序后的序列，其实就是二叉搜索树的中序遍历序列。

代码如下

#include<iostream>
#include<algorithm>
using namespace std;
int n,b[105],cnt = 0;
struct node{
	int data,left,right,index,level;
}a[105]; 
int 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) dfs(a[root].left,index*2+1,level+1);
	a[root] = {b[cnt++],a[root].left,a[root].right,index,level};
	if(a[root].right != -1) dfs(a[root].right,index*2+2,level+1);
}
int main()
{
	cin>>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-1; i++){
		cout<<a[i].data<<" ";
	}
	cout<<a[n-1].data;
	return 0;
}