1064 Complete Binary Search Tree 甲级 xp_xht123

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

解题思路：若父节点是x，那么左孩子是 2 * x，右孩子是 2 * x + 1

二叉树搜索树的中序遍历就是给定数组的递增顺序

所以，先排序再模拟中序遍历将逐个结果填进去即可的得到层序遍历结果

以下是完整代码：

//二叉树搜索树的中序遍历就是给定数组的递增顺序
/*
若父节点是x
那么左孩子是 2 * x
右孩子是 2 * x + 1
所以dfs从1开始
*/
#include<iostream>
#include<algorithm>

using namespace std;
const int N = 1010;
int n;
int inorder[N];
int res[N];
int k = 0;//中序遍历中的节点下标

void dfs(int u)
{
    //判断左子树是否越界
    if(u * 2 <= n) dfs(2 * u);
    res[u] = inorder[k ++];
    //判断右子树是否越界
    if(u * 2 + 1 <= n) dfs(2 * u + 1);
}

int main()
{
    cin>>n;
    for(int i = 0;i < n;i++) cin>>inorder[i];
    
    sort(inorder , inorder + n);
    
    dfs(1);
    
    for(int i = 1;i <= n;i++)
    {
        if(i != 1) cout<<" ";
        cout<<res[i];
    }
    return 0;
}