1064 Complete Binary Search Tree (30)（30 分）

1064 Complete Binary Search Tree (30)（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

这题我不会做看博客的转载来自:https://blog.csdn.net/ryo_218/article/details/81462130

原来完全二叉搜索树的中序遍历就是从小到大排序输出

这题要求的是层序遍历这个二叉搜索树.............既然知道中序遍历了也就可以求出这个了

代码:

#include<bits/stdc++.h>
using namespace std;
int n, a[1005], b[1005], k = 0;
void inorder(int root)
{
	if (root<n)
	{
		inorder(2 * root + 1);
		b[root] = a[k++];
		printf("%d ====%d\n",root,k-1);
		inorder(2 * root + 2);
	}
}
 
int main()
{
	cin >> n;
	for (int i = 0; i<n; i++)
		cin >> a[i];
	sort(a, a + n); //从小到大排序 因为完全二叉搜索树的中序遍历就是从小到大排序 
	inorder(0);
	for (int i = 0; i<n - 1; i++)
		cout << b[i] << " ";
	cout << b[n-1] << endl;
	return 0;
}