1064 Complete Binary Search Tree （30 分）(平衡二叉搜索树，中序转层序)

最新推荐文章于 2024-08-17 18:02:02 发布

小火汁猛猛

最新推荐文章于 2024-08-17 18:02:02 发布

阅读量119

点赞数 1

CC 4.0 BY-SA版权

分类专栏： c++ 甲级文章标签： PAT

本文链接：https://blog.youkuaiyun.com/qq_42068614/article/details/87571884

c++ 同时被 2 个专栏收录

115 篇文章

订阅专栏

甲级

92 篇文章

订阅专栏

本文介绍了一种根据给定的非负整数序列构造完全二叉搜索树的方法，并通过中序遍历输出该树的层次遍历序列。文章详细解释了二叉搜索树和完全二叉树的定义，然后提供了一个具体的实现算法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

1 2 3 4 5 6 7 8 9 0

Sample Output:

6 3 8 1 5 7 9 0 2 4

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cctype>
#include <string.h>
#include <cstdio>
using namespace std;
#define MAX 1010
int n,bst[MAX],a[MAX],num=0;
void inorder(int root){//中序遍历
    if(root>n) return;
    inorder(root*2);
    bst[root]=a[num++];
    inorder(root*2+1);
}
int main()
{
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        scanf("%d",&a[i]);
    sort(a,a+n);
    inorder(1);
    for(int i=1;i<=n;i++){
        printf("%d",bst[i]);
        if(i<n) printf(" ");
    }
    return 0;
}