PAT甲级1064 Complete Binary Search Tree (30 分)

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

结尾无空行

其实就是二叉搜索树变成完全二叉树+搜索树

排序，然后中序插入，在层次遍历就可以（用数组可以直接顺序遍历） 

 

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int res[1010]={0};
vector<int> vec;
int pos=0;
void inorder(int i,int n)
{
    if(i>n)return;
    inorder(i*2,n);
    res[i]=vec[pos];
    pos++;
    inorder(i*2+1,n);
}
int main()
{
    int total;
    cin>>total;
    for(int i=0;i<total;i++)
    {
        int num;
        scanf("%d",&num);
        vec.push_back(num);
    }
    sort(vec.begin(),vec.end());
    inorder(1,total);
    for(int i=1;i<=total;i++)
    {
        printf("%d",res[i]);
        if(i<total)
            printf(" ");
    }
    printf("\n");
    return 0;
}