PAT甲级1043 Is It a Binary Search Tree

AC代码

#include<bits/stdc++.h>
using namespace std;
struct Node{
    Node *left,*right;
    int data;
};
vector<int> ini,pre,prem,post,postm;
Node* root=NULL;
void insert(Node* &root,int data)
{
    if(root==NULL)
    {
        root=new Node;
        root->data=data;
        root->left=root->right=NULL;
        return;
    }
    if(data<root->data) insert(root->left,data);
    else insert(root->right,data);
}
void preOrder(Node* root)
{
    if(root==NULL) return;
    pre.push_back(root->data);
    preOrder(root->left);
    preOrder(root->right);
}
void postOrder(Node* root)
{
    if(root==NULL) return;
    postOrder(root->left);
    postOrder(root->right);
    post.push_back(root->data);
}
void premOrder(Node* root)
{
    if(root==NULL) return;
    prem.push_back(root->data);
    premOrder(root->right);
    premOrder(root->left);
}
void postmOrder(Node* root)
{
    if(root==NULL) return;
    postmOrder(root->right);
    postmOrder(root->left);
    postm.push_back(root->data);
}
int main()
{
    int n,temp;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&temp);
        ini.push_back(temp);
        insert(root,temp);
    }
    preOrder(root);
    premOrder(root);
    if(pre==ini)
    {
        printf("YES\n");
        postOrder(root);
        for(int i=0;i<post.size();i++)
        {
            printf("%d",post[i]);
            if(i!=post.size()-1) printf(" ");
        }
    }
    else if(prem==ini){
        printf("YES\n");
        postmOrder(root);
        for(int i=0;i<postm.size();i++)
        {
            printf("%d",postm[i]);
            if(i!=postm.size()-1) printf(" ");
        }
    }else printf("NO");
    return 0;
}