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

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

题解

排好序就是CBT中序遍历的序列，因此有两种思路：

1. 直接中序构造。
2. 一棵完全二叉树，如果知道其节点数，是可以求出根节点在中序序列中的位置的，由此构造CBT。

#include <bits/stdc++.h>
using namespace std;

const int maxn = 1010;
int a[maxn];
int b[maxn];
int n;
int k;

void build(int root){
    if(root >= n) return;   

    build(root * 2 + 1);
    b[root] = a[k++];
    build(root * 2 + 2);

}

void build_too(int root, int left, int right){
    if(left > right) return;

    int n = right - left + 1;
    int level = log(n + 1) / log(2);
    int leave = n - (pow(2, level) - 1);
    int idx = left + pow(2, level - 1) - 1 + min((int)pow(2, level - 1), leave);
    b[root] = a[idx];
    build_too(root * 2 + 1, left, idx - 1);
    build_too(root * 2 + 2, idx + 1, right);

}

int main(){
    scanf("%d", &n);
    for(int i = 0; i < n; ++i) scanf("%d", a + i);

    sort(a, a + n);
    //build(0);
    build_too(0, 0, n - 1);

    for(int i = 0; i < n; ++i){
        if(i) printf(" ");
        printf("%d", b[i]);
    }


    return 0;
}