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 , provided that the nodes are numbered from 0 to left_index right_indexN−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:

<span style="color:#404040"><span style="background-color:#ffffff"><code class="language-in">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
</code></span></span>

Sample Output:

<span style="color:#404040"><span style="background-color:#ffffff"><code class="language-out">58 25 82 11 38 67 45 73 42</code></span></span>

 

#include<cstdio>
#include<vector>
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;

typedef long long ll;

const int N = 1e5+10;
map<int,int>l,r;
int kp[10010];
int res[10010];
int u=0;
void dfs(int t){
	if(l[t]!=-1)dfs(l[t]);
	res[t]=kp[u++];
	if(r[t]!=-1)dfs(r[t]);
	
}
void print(){
	queue<int>p;
	p.push(0);
	int num=0;
	while(p.size()){
		int t=p.front();
		if(!num++)cout<<res[t];
		else cout<<' '<<res[t];
		p.pop();
		if(l.count(t)&&l[t]!=-1)p.push(l[t]);
		if(r.count(t)&&r[t]!=-1)p.push(r[t]);
	}
}
int main(){
	int n;
	cin>>n;
	int x,y;
	for(int i=0;i<n;i++){
		cin>>x>>y;
		l[i]=x;
		r[i]=y;
	}
	for(int i=0;i<n;i++){
		cin>>kp[i];
	}
	sort(kp,kp+n);
	dfs(0);
	print();
	return 0;
}