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 Nlines 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
作者: CHEN, Yue
单位: 浙江大学
时间限制: 200 ms
内存限制: 64 MB
#include <iostream>
#include <cstdio>
#include <string.h>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <sstream>
#include <queue>
using namespace std;
const int MAX = 105;
struct node{
int id;
int value;
int left,right;
};
node node1[MAX];
int a[MAX];
int k = 0;
void Inorder(int root){
if(root == -1){
return ;
}
Inorder(node1[root].left);
node1[root].value = a[k++];
Inorder(node1[root].right);
}
int main(){
ios::sync_with_stdio(false);
int n;
cin>>n;
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
node1[i].id = i;
node1[i].left = a;
node1[i].right = b;
}
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
Inorder(0);
queue<node> q;
q.push(node1[0]);
bool flag = false;
while(!q.empty()){
node temp = q.front();
q.pop();
if(flag){
cout<<" ";
}
flag = true;
cout<<temp.value;
if(temp.left != -1) q.push(node1[temp.left]);
if(temp.right != -1) q.push(node1[temp.right]);
}
return 0;
}