【PAT】1043. Is It a Binary Search Tree

考查点：BST的插入，二叉树的遍历

思路：题中的镜像树只要遍历的时候交换左右子树的顺序即可，此题用指针表示方便，另外直接用向量存放遍历序列这样比较时候直接用==即可

提交情况：这里的后序遍历如果是镜像树要输出镜像树的后序，注意理解题意

#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define FOR(i, x, y) for(int i = x; i <  y; i++)
#define rFOR(i, x, y) for(int i = x; i > = y; i--)
#define MAXN 110
#define oo 0x3f3f3f3f
using namespace std;
struct node{
    int data;
    node *lchild,*rchild;
};
int n;
int num;
void insertBST(node* &root,int data){
    if(root==NULL){
        root=new node;
        root->data=data;
        root->lchild=root->rchild=NULL;
        return;
    }
    if(data<root->data) insertBST(root->lchild,data);
    else insertBST(root->rchild,data);
}
void preorder(node* root,vector<int>& vi){
    if(root==NULL) return ;
    vi.push_back(root->data);
    preorder(root->lchild,vi);
    preorder(root->rchild,vi);
}
void premorder(node* root,vector<int>& vi)
{
    if(root==NULL) return;
    vi.push_back(root->data);
    premorder(root->rchild,vi);
    premorder(root->lchild,vi);
}
void postorder(node* root)
{
    if(root==NULL)return;
    postorder(root->lchild);
    postorder(root->rchild);
    num++;
    printf("%d",root->data);
    if(num<n)printf(" ");
}
void postmorder(node* root)
{
    if(root==NULL) return;
    postmorder(root->rchild);
    postmorder(root->lchild);
    num++;
    printf("%d",root->data);
    if(num<n)printf(" ");
}
int main()
{
    #ifdef LOCAL
        freopen("data.in","r",stdin);
        freopen("data.out","w",stdout);
    #endif // LOCAL
    scanf("%d",&n);
    node* root=NULL;
    vector<int> origin,pre,prem;
    FOR(i,0,n)
    {
        int x;
        scanf("%d",&x);
        origin.push_back(x);
        insertBST(root,x);
    }
    preorder(root,pre);
    premorder(root,prem);
    if(origin==pre){
        printf("YES\n");
        postorder(root);
    }else if(origin==prem){
        printf("YES\n");
        postmorder(root);
    }else printf("NO\n");


    return 0;
}