甲级PAT 1099 Build A Binary Search Tree （30 分）(BST)

最新推荐文章于 2019-12-23 13:29:34 发布

Joyceyang_999

最新推荐文章于 2019-12-23 13:29:34 发布

阅读量185

点赞数

分类专栏： PAT甲级

本文链接：https://blog.csdn.net/Joyceyang_999/article/details/87892873

版权

PAT甲级专栏收录该内容

120 篇文章 3 订阅

订阅专栏

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

题目要求

给定一棵二叉树，将给定的序列给二叉树中的每个结点赋值，构成一棵二叉查找树，然后输出其层序遍历的值

解题思路

因为二叉查找树中序遍历的结果是从小到大排序，所以对给定序列按从小到大进行排序，然后依次赋值对给定二叉树进行中序遍历的每个结点中。最后层序输出

#include<bits/stdc++.h>
using namespace std;

struct Node{
	int data,lchild,rchild;
}node[110];

int n,a[110],index=0;

void intra(int root){
	if(root==-1) return;
	int left=node[root].lchild;
	int right=node[root].rchild;
	intra(left);
	node[root].data=a[index++];
	intra(right);
}

void leveltra(){
	queue<int> q;
	q.push(0);
	while(!q.empty()){
		int top=q.front();
		if(top==0) cout<<node[0].data;
		else cout<<" "<<node[top].data;
		q.pop();
		int left=node[top].lchild;
		int right=node[top].rchild;
		if(left!=-1) q.push(left);
		if(right!=-1) q.push(right);
	}
}

int main(){
	int i,u,v;
	cin>>n;
	for(i=0;i<n;i++){
		cin>>u>>v;
		node[i].lchild=u;
		node[i].rchild=v;
	}
	for(i=0;i<n;i++) cin>>a[i];
	sort(a,a+n);
	intra(0);
	leveltra();
	return 0;
}