pat 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

根据二叉搜索树的中序遍历是递增序列，完全二叉树的性质： 设根结点编号为i，左孩子结点编号为2*i，右孩子结点编号为2*i+1；

层序遍历就是按结点编号从小到大来。

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
#include<vector>
#include<map>
#include<algorithm>
#include<queue>
#define MS(a,b) memset(a,b,sizeof(a))
int tree[2000],n,num[2000],j;
void inorder(int root)
{
   int lchild=root*2,rchild=root*2+1;
   if(root>n)return ;
   inorder(lchild);
   tree[root]=num[j++];
   inorder(rchild);
}
int main()
{
    /*#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    #endif*/
    int i;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
     scanf("%d",&num[i]);
     sort(num+1,num+1+n);
      j=1;
     inorder(1);
     for(i=1;i<n;i++)
        printf("%d ",tree[i]);
        printf("%d\n",tree[i]);
    return 0;
}