PAT甲级：1064 Complete Binary Search Tree｜Python

目录

题目描述

Input Specification:

Output Specification:

Sample Input:

Sample Output:

题目大意 

解题思路 

Python3代码 

---

题目描述

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

题目大意 

二叉搜索树 (BST) 递归定义为具有以下属性的二叉树：

• 若它的左子树不空，则左子树上所有结点的值均小于它的根结点的值
• 若它的右子树不空，则右子树上所有结点的值均大于或等于它的根结点的值
• 它的左、右子树也分别为二叉搜索树

完全二叉树 (CBT) 定义为除最深层外的其他层的结点数都达到最大个数，最深层的所有结点都连续集中在最左边的二叉树。

现在，给定 N 个不同非负整数，表示 N 个结点的权值，用这 N 个结点可以构成唯一的完全二叉搜索树。

请你输出该完全二叉搜索树的层序遍历。

输入格式

第一行包含整数 N，表示结点个数。

第二行包含 N 个不同非负整数，表示每个结点的权值。

输出格式

共一行，输出给定完全二叉搜索树的层序遍历序列。

数据范围

1≤N≤1000,
结点权值不超过 2000。

输入样例：

10
1 2 3 4 5 6 7 8 9 0

输出样例：

6 3 8 1 5 7 9 0 2 4

解题思路 

二叉排序树的中序遍历序列是有序的，

先将原输入数组排序、再模拟中序遍历、逐个将结果填进去即可的得到层序遍历结果

完全二叉排序树可以只用一个一维数组来存储

下标从1开始左孩子为 2*n 右孩子为 2*n+1 (若存在)

Python3代码 

N = int(input())
lst = list(map(int,input().split()))
lst.sort()
tr = [0]*(N+10)

# 中序遍历
def dfs(node) :
    global idx
    if node * 2 <= N : dfs(node*2)
    tr[node] = lst[idx]
    idx += 1
    if node * 2 + 1 <= N : dfs(node*2+1)

idx = 0
dfs(1)
for i in range(1,N+1) : print(tr[i],end=' ')