A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:
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 0Sample Output:
6 3 8 1 5 7 9 0 2 4
#include<cstdio>
#include<algorithm>
#define MAX 1005
using namespace std;
int Keys[MAX];
int Level[MAX];
int ID=0;
void ReBulid(int i,int n)
{
int l=2*i;
int r=2*i+1;
if(i>n)
return;
ReBulid(l,n);
Level[i]=Keys[ID++];
if(r<=n)
ReBulid(r,n);
}
int main(int argc,char *argv[])
{
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&Keys[i]);
sort(Keys,Keys+n);
ReBulid(1,n);
for(i=1;i<n;i++)
printf("%d ",Level[i]);
printf("%d\n",Level[n]);
return 0;
}
Pat(Advanced Level)Practice--1064(Complete Binary Search Tree),布布扣,bubuko.com
Pat(Advanced Level)Practice--1064(Complete Binary Search Tree)
原文：http://blog.csdn.net/cstopcoder/article/details/24552561