PAT1043 Is It a Binary Search Tree 二叉搜索树-CSDN博客

本文链接：https://blog.csdn.net/kl782636177/article/details/105207863

给定一个整数键值序列，判断这是否是对一棵二叉搜索树或其镜像进行前序遍历的结果，是的话要输出后序序列

在建二叉搜索树的同时建一颗镜像的二叉搜索树，再将原序列与两颗树的前序比对。

最开始交上去只有3分。。百思不得其解..查了近两小时bug，最后发现是“YES“打成“Yes”，心态大崩

#include <iostream>
#include<bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define sca(x) scanf("%d",&x)
#define sca2(x,y) scanf("%d%d",&x,&y)
#define scl(x) scanf("%lld",&x)
#define pri(x) printf("%d\n",x)
#define pri2(x,y) printf("%d %d\n",x,y)
#define prs(x) printf("%s\n",(x))
#define prl(x) printf("%lld\n",x)
#define ll long long
#define PII pair<int,int>
#define eps 1e-6
#define inf 1e17
#define INF 0x3f3f3f3f
using namespace std;
const int maxn=1e5+5;


vector<int>v,pre,preM,post,postM;
struct node{
    int data;
    node*l,*r;
};

void insert1(node*&root,int data){
    if(root==NULL){
        root=new node;
        root->data=data;
        root->l=root->r=NULL;
        return;
    }
    if(data<root->data) insert1(root->l,data);
    else insert1(root->r,data);
}
void insert2(node*&root,int data){
    if(root==NULL){
        root=new node;
        root->data=data;
        root->l=root->r=NULL;
        return;
    }
    if(data<root->data) insert2(root->r,data);
    else insert2(root->l,data);
}

void preOrder(node *root,vector<int>&vi){
    if(root==NULL)return;
    vi.push_back(root->data);
    preOrder(root->l,vi);
    preOrder(root->r,vi);
}
void postOrder(node *root,vector<int>&vi){
    if(root==NULL)return;
    postOrder(root->l,vi);
    postOrder(root->r,vi);
    vi.push_back(root->data);
}

int main(){
    int n,data;
    node*root=NULL,*rootM=NULL;
    sca(n);
    rep(i,0,n){
        sca(data);
        v.push_back(data);
        insert1(root,data);
        insert2(rootM,data);
    }
    preOrder(root,pre);
    preOrder(rootM,preM);
    postOrder(root,post);
    postOrder(rootM,postM);
   if(v==pre){
        puts("YES");
        rep(i,0,post.size()){
            printf("%d%c",post[i],i==post.size()-1?'\n':' ');
        }
    }
    else if(v==preM){
        puts("YES");
        rep(i,0,postM.size()){
            printf("%d%c",postM[i],i==postM.size()-1?'\n':' ');
        }
    }
    else puts("NO");
    return 0;
}