PAT甲级1064

PAT甲级1064

题目：
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

题目大意：输入10个数，这些数是完全二叉搜索树中的节点，求出这棵树的层序遍历
博主一开始想复杂了，由于这些数从小到大排序就是中序序列，所以想着再整一个先序序列就O了，最后有两三个测试点没过很尴尬。后来想到的这个方法，BST对应的数组下标之间有关联，可以直接利用数组从1开始存放BST的下标，然后中序建树，最后按顺序输出就是层序序列

#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <queue>
using namespace std;
vector<int> in,CBT(1001);
int n,cnt=0;
void inCreate(int root){
	if(root>n) return ;
	inCreate(root*2);
	CBT[root]=in[cnt++];
	inCreate(root*2+1);
}
int main(){
	int tmp;
	scanf("%d",&n);
	fill(CBT.begin(),CBT.end(),-1);
	for(int i=0;i<n;i++){
		scanf("%d",&tmp);
		in.push_back(tmp);
	}
	sort(in.begin(),in.end());
	inCreate(1);
	for(int i=1;i<=n;i++){
		if(i!=1) printf(" ");
		printf("%d",CBT[i]);
	}
	system("pause");
	return 0;
}