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
作者: CHEN, Yue
单位: 浙江大学
时间限制: 200 ms
内存限制: 64 MB
代码长度限制: 16 KB
题目大意:给你一个BST的结构(如图示),一个所有元素都互异的序列,只有一种插入顺序能把这个序列构成一棵所示的BST,要求你给出这棵树的层序序列
解题思路:我们先按照给出的BST结构建树,然后把给出的序列进行排序,得到了BST的中序序列,然后用对之前建好的BST进行中序遍历,如果这个结点存在,就把这个数插入。最后对这棵BST进行层序遍历。
AC代码:
#include<iostream>
#include<cstdio>
#include<string>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn=1010;
struct node{
int data;
int lchild,rchild;
}tree[maxn];
int number[maxn],n,index=0;
vector<int> tseq;
void levelorder(int root);
void inorder(int root);
int main()
{
cin>>n;
int left,right;
for(int i=0;i<n;i++)
{
cin>>left>>right;
tree[i].lchild=left;
tree[i].rchild=right;
}
for(int i=0;i<n;i++)
cin>>number[i];
sort(number,number+n);
inorder(0);
levelorder(0);
return 0;
}
void inorder(int root)
{
if(root==-1)//结点不存在,递归退出条件
return;
inorder(tree[root].lchild);
tree[root].data=number[index++];
inorder(tree[root].rchild);
}
void levelorder(int root)
{
queue<int> q;
q.push(root);
int num=0;
while(!q.empty())
{
int top=q.front();
q.pop();
printf("%d",tree[top].data);
num++;
if(num<n)
cout<<" ";
if(tree[top].lchild!=-1)
q.push(tree[top].lchild);
if(tree[top].rchild!=-1)
q.push(tree[top].rchild);
}
}