04-树6 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<algorithm>
using namespace std;

const int maxn = 1005;
int a[maxn],t[maxn]; //t[]保存结果，即是那个 完全二叉搜索树
int n,pos=1;//pos存储a[]的下标，从1开始

//按照中序遍历的方式来构造这棵完全二叉搜索树 
void inOrder(int index)
{
    if(index*2 <= n)    inOrder(index*2);
    t[index] = a[pos++];//这里的遍历就是赋值，一般情况下的遍历是输出
    if(index*2+1 <= n)  inOrder(index*2+1);
}

int main()
{
    cin>>n;
    for(int i=1; i<=n; i++)
    {
        cin>>a[i];
    }
    sort(a+1,a+n+1);//排序之后a[]中保存的就是中序遍历的结果
    inOrder(1);//从根结点1开始中序遍历

    //层序输出，由于数组存储完全二叉树的性质，层序输出就是顺序输出
    for(int i=1; i<=n; i++)
    {
        cout<<t[i];
        if(i != n)  cout<<" ";
    }
    cout<<endl;
}