A1167 Cartesian Tree（30分）PAT甲级 (Advanced Level) Practice（C++）满分题解【最小堆+构建树+层序遍历】

最新推荐文章于 2024-09-29 23:53:24 发布

烧烤大团子

最新推荐文章于 2024-09-29 23:53:24 发布

阅读量120

点赞数

分类专栏： # PAT

本文链接：https://blog.csdn.net/qq_47677800/article/details/125091429

版权

卡特兰树最小堆层次遍历二叉树 C++

关键词由CSDN通过智能技术生成

PAT 专栏收录该内容

91 篇文章 1 订阅

订阅专栏

A Cartesian tree is a binary tree constructed from a sequence of distinct numbers. The tree is heap-ordered, and an inorder traversal returns the original sequence. For example, given the sequence { 8, 15, 3, 4, 1, 5, 12, 10, 18, 6 }, the min-heap Cartesian tree is shown by the figure.

Your job is to output the level-order traversal sequence of the min-heap Cartesian tree.

Input Specification:

Each input file contains one test case. Each case starts from giving a positive integer N (≤30), and then N distinct numbers in the next line, separated by a space. All the numbers are in the range of int.

Output Specification:

For each test case, print in a line the level-order traversal sequence of the min-heap Cartesian tree. All the numbers in a line must be separated by exactly one space, and there must be no extra space at the beginning or the end of the line.

Sample Input:

10
8 15 3 4 1 5 12 10 18 6

Sample Output:

1 3 5 8 4 6 15 10 12 18

代码如下：

#include<iostream>
#include<vector>
#include<queue>
using namespace std;
const int MAX=0x3fffffff;
struct Node{
    int data;
    Node *left,*right;
}*tree;
vector<int> nodelist;
Node* check(int low,int high)
{
    if(low<0||high<low)return NULL;//遍历完成
    Node *newtree=new Node;
    int min=low;
    for(int i=low;i<=high;i++)
        if(nodelist[i]<nodelist[min])min=i;
    newtree->data=nodelist[min];
    newtree->left=check(low,min-1);
    newtree->right=check(min+1,high);
    return newtree;
}
int main()
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        int index;
        cin>>index;
        nodelist.push_back(index);
    }
    tree=check(0,n-1);
    int flag=0;
    queue<Node*> q;
    q.push(tree);
    while(!q.empty()){
        Node *t=q.front();
        if(flag==1)cout<<" ";//只有第一个数前面不要输出空格
        else flag=1;
        cout<<t->data;
        if(t->left)q.push(t->left);
        if(t->right)q.push(t->right);
        q.pop();
    }
    return 0;
}