# 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

### AC代码：

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int tree[1001],start=0,cnt=1,N;
vector<int> v;
bool cmp(int a,int b) {
return a<b;
}
void input(int start){
if(start*2<=N)
input(start*2);
tree[start]=v[cnt-1];
cnt++;
if(start*2+1<=N)
input(start*2+1);
}
int main(){
int i;
cin>>N;
for(i=0;i<N;i++){
int num;
scanf("%d",&num);
v.push_back(num);
}
sort(v.begin(),v.end(),cmp);
input(1);
for(i=1;i<N;i++)
printf("%d ",tree[i]);
printf("%d\n",tree[i]);
return 0;
}

08-09 474

11-17 27

03-31 242

03-06 288

10-13 26

01-11 252

09-04 190

04-30 111

02-11 79

08-17 79

02-25 124

08-19 1611

04-20 176

04-18 31

10-31 560

08-21 20

06-06 66

01-15 76

08-28 244

#### 1064 Complete Binary Search Tree（30 分)

©️2020 CSDN 皮肤主题: 黑客帝国 设计师: 上身试试

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、C币套餐、付费专栏及课程。