pta7-7 Complete Binary Search Tree (30分)

最新推荐文章于 2024-05-07 00:14:45 发布

原创最新推荐文章于 2024-05-07 00:14:45 发布 · 662 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#二叉树 #算法 #数据结构

PTA 数据结构题目集专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一种基于前序遍历思想构建完全二叉搜索树的方法，通过将输入的非负整数序列按升序排列并填充到二叉树中，确保了树的左子树键值小于根节点，右子树键值大于等于根节点，同时满足完全二叉树的定义。

7-7 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

利用前序遍历的思想。按前序遍历的顺序从小到大将数字填入二叉树中正好可以形成二叉搜索树。

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int n,i,l1[1001],l2[2010];
int c=0;
void inorder(int k)
{
    if(k>n)
        return;
    inorder(k*2);
    l2[k]=l1[c++];
    inorder(k*2+1);
}

void levelprint()
{
    for(i=1;i<=n;i++)
    {
        if(i==1)
            printf("%d",l2[i]);
        else
            printf(" %d",l2[i]);
    }
}

int cmp(const void *a,const void *b)
{
    return *(int *)a-*(int *)b;
}

int main()
{
    scanf("%d",&n);
    for(i=0;i<n;i++)
        scanf("%d",&l1[i]);
    qsort(l1,n,sizeof(l1[0]),cmp);
    inorder(1);
    levelprint();
}