1043 Is It a Binary Search Tree (25 分)(******)

#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;

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

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

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

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

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

int main()
{
//    freopen("1.txt","r",stdin);
    int n;
    vector<int>origin,pre,post,preM,postM;
    scanf("%d",&n);
    for(int i = 0;i<n;i++)
    {
        int data;
        scanf("%d",&data);
        origin.push_back(data);
        insertT(root,data);
    }

    preO(root,pre);
    preOM(root,preM);
    postO(root,post);
    postOM(root,postM);
    if(origin == pre)
    {
        printf("YES\n");
        for(int i = 0;i<post.size();i++)
        {
            printf("%d",post[i]);
            if(i!=post.size()-1)
                printf(" ");
        }
    }
    else if(origin == preM)
    {
        printf("YES\n");
        for(int i = 0;i<postM.size();i++)
        {
            printf("%d",postM[i]);
            if(i!=postM.size()-1)
                printf(" ");
        }
    }
    else
        printf("NO");
    return 0;
}