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

//给你n个数，要求你构建一棵CST，并按层次遍历输出；

//思路：先构建一棵值为-1的完全二叉搜索树（n层）， 由于BST的中序是单调非递减的，所以，对n个数排序，按中序遍历填入值；

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
int a[1005];
int indexx;
struct Node
{
    int val;
    Node *l;
    Node *r;
    Node()
    {
        val=-1;
        l=NULL;
        r=NULL;
    }
};
void creatTree(Node *root,int n)
{
    queue<Node*>q;
    if(n==0)return ;
    q.push(root);
    n--;
    if(n==0)return;
    while(!q.empty())
    {
        Node *temp=q.front();
        q.pop();
        temp->l=new Node;
        q.push(temp->l);
        n--;
        if(n==0)break;
        temp->r=new Node;
        q.push(temp->r);
        n--;
        if(n==0)break;
    }
}

void inorder(Node *root)
{
    if(root==NULL)return ;
    inorder(root->l);
    root->val=a[indexx++];
    inorder(root->r);
}
void levelorder(Node *root)
{
    queue<Node *>q;
    if(root!=NULL)
    {
        printf("%d",root->val);
        q.push(root);
    }
    while(!q.empty())
    {
        Node *temp=q.front();
        q.pop();
        if(temp->l!=NULL)
        {
            printf(" %d",temp->l->val);
            q.push(temp->l);
        }
        if(temp->r!=NULL)
        {
            printf(" %d",temp->r->val);
            q.push(temp->r);
        }
    }
}
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++)scanf("%d",&a[i]);
    sort(a,a+n);
    Node* root=new Node;
    creatTree(root,n);
    indexx=0;
    inorder(root);
    levelorder(root);
    return 0;
}