PAT 1064 Complete Binary Search Tree (30)

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

ryo_218

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

阅读量360

点赞数 1

分类专栏：树 PAT

本文链接：https://blog.csdn.net/ryo_218/article/details/81462130

版权

PAT 同时被 2 个专栏收录

65 篇文章 1 订阅

订阅专栏

树

16 篇文章 0 订阅

订阅专栏

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

思路：

一棵排序二叉树的中序遍历就是这一组数的递增序列。这边是完全二叉树，假设从0开始，那么节点i的左孩子的标号就是2*i+1，右孩子的标号就是2*(i+1)。先将这组数按照递增来排序，然后用中序遍历复原这棵完全排序二叉树，最后直接输出。

代码：

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>  
#include <set>
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++];
		inorder(2 * root + 2);
	}
}

int main()
{
	int i;
	cin >> n;
	for (i = 0; i<n; i++)
		cin >> a[i];
	sort(a, a + n);
	inorder(0);
	for (i = 0; i<n - 1; i++)
		cout << b[i] << " ";
	cout << b[i] << endl;
	return 0;
}