1064. Complete Binary Search Tree

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.

#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
using namespace std;
#define N 1001
vector<int> num;
int n,index=0;
void In (int root,int * cbt);
int main ()
{
    scanf("%d",&n);
    int i,temp;
    int *cbt=new int[n+1];
    for( i=0;i<n;i++)
    {
         scanf("%d",&temp);
         num.push_back(temp);
         }
    sort(num.begin(),num.end());
    In(1,cbt);
    printf("%d",cbt[1]);
    for( i=2;i<n;i++) printf(" %d",cbt[i]);
    system("pause");
    return 0;
    }
void In (int root,int * cbt)
{
     if( root>n) return;
     In(root*2,cbt);
     cbt[root]=num[index++];
     In(root*2+1,cbt);
     }