A1064. 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

定义index时候系统报错，说Index redeclare,加上index1就好了。
完全二叉树，根节点编号1，左孩子2x,右孩子2x+1。
又因为二叉排序树，其中序遍历是递增的。把输入的数递增排列就是其中序排列的结果。已知结果了，可以将结果回带，求出按根号排列的数组，就是其层序排列了。

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;

const int maxn=1010;
int n,number[maxn],CBT[maxn],index1=0;//n结点数，number结点权值，cbt完全二叉树，index1从小到大枚举数组number
void inorder(int root)
{
	if(root>n)
		return;
	inorder(root*2);
	CBT[root]=number[index1++];
	inorder(root*2+1);
}
int main()
{
//	freopen("data.in","r",stdin);
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d",&number[i]);
	}
	sort(number,number+n);//默认从小到大排序
	inorder(1);
	for(int j=1;j<=n;j++)
	{
		printf("%d",CBT[j]);
		if(j<n)
			printf(" ");
	}
	return 0;
}