pat 甲级 A1064 Complete Binary Search Tree (30分)

1064 Complete 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.

A Complete Binary Tree (CBT) is a tree that is completely filled, with the possible exception of the bottom level, which is filled from left to right.

Now given a sequence of distinct non-negative integer keys, a unique BST can be constructed if it is required that the tree must also be a CBT. You are supposed to output the level order traversal sequence of this BST.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer N (≤1000). Then N distinct non-negative integer keys are given in the next line. All the numbers in a line are separated by a space and are no greater than 2000.

Output Specification:

For each test case, print in one line the level order traversal sequence of the corresponding complete binary search tree. All the numbers in a line must be separated by a space, and there must be no extra space at the end of the line.

Sample Input:

10
1 2 3 4 5 6 7 8 9 0

Sample Output:

6 3 8 1 5 7 9 0 2 4

题意： 给一串构成树的序列，已知该树是完全二叉搜索树，求它的层序遍历序列。

分析：已知中序，从根节点开始中序遍历，按中序数组给出的顺序依次将值填入level数组对应的下标中，输出level数组可得层序遍历。 因为二叉搜索树的中序满足：是一组序列的从小到大排列。

#include <iostream>
#include<algorithm> 
using namespace std;
int level[1010],a[1010],n,t=0;
void inOrder(int root){
	if(root>n) return;
	else{
		inOrder(root*2);
		level[root]=a[t++];
		inOrder(root*2+1);
	}
}
int main(){
	cin>>n;
	for(int i=0;i<n;i++)
	cin>>a[i];
	sort(a,a+n);
	inOrder(1);
	cout<<level[1];
	for(int i=2;i<=n;i++)
	cout<<" "<<level[i];
	return 0;
}