PAT　A1064 Complete Binary Search Tree (30 分)(利用输入数据直接建立完全二叉排序树中序遍历与层次遍历的联系）

最新推荐文章于 2022-06-06 14:07:27 发布

小魚兒.

最新推荐文章于 2022-06-06 14:07:27 发布

阅读量83

点赞数

分类专栏：二叉排序树

本文链接：https://blog.csdn.net/qq_43590614/article/details/102606863

版权

二叉排序树专栏收录该内容

6 篇文章 0 订阅

订阅专栏

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

完全二叉树中根节点编号为i，则其左孩子必为2*i，右孩子为2*i+1.利用此性质，开一个cbt数组，存放二叉树层序遍历的序列。

因为二叉排序树的中序遍历是递增的，固先将输入的数据从小到大排序，然后对cbt表示的二叉树进行中序遍历，并在遍历过程中将数据从小到大填入数组，这样就能得到二叉树的层序遍历序列。

参考代码：

#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=1010;
//n为结点数，number用来存放结点权值，cbt存放完全二叉树 
int n,number[maxn],cbt[maxn],index=0;
void inorder(int root) 
{
	if(root>n)//空结点，直接返回
		return;
	inorder(root*2);//左子树递归
	cbt[root]=number[index++];//根节点处赋值number[index] 
	inorder(root*2+1);//右子树递归 
}
int main()
{
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d",&number[i]);
	}
	sort (number,number+n);
	inorder(1);//1号位为根结点
	for(int i=1;i<=n;++i)
	{
		printf("%d",cbt[i]);
		if(i<n)
			printf(" ");
	}
	return 0;
}