1043 Is It a Binary Search Tree (25 分) + 测试注意点

题目描述：

A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:

The left subtree of a node contains only nodes with keys less than the node’s key.
The right subtree of a node contains only nodes with keys greater than or equal to the node’s key.
Both the left and right subtrees must also be binary search trees.
If we swap the left and right subtrees of every node, then the resulting tree is called the Mirror Image of a BST.

Now given a sequence of integer keys, you are supposed to tell if it is the preorder traversal sequence of a BST or the mirror image of a BST.
（……）

问题解决：

1. 认为只有一个节点是BST
   测试点：
   1
   1
   输出：
   NO
2. 输出时行内不能有多余的空格，整体不能有多余的行

试着输出了一下，第1、7个测试点答案是NO，其他是YES
以下代码过不了第4个测试点

#include<iostream>
#include<fstream>
#include<queue>
#include<vector>
#include<algorithm>
#define MAX 100
using namespace std;

struct Node{
    Node* left= nullptr;
    Node* right= nullptr;
    int data;
};

Node* newNode(int data){
    Node* node = new Node;
    node->data = data;
    node->left=node->right= nullptr;
    return node;
}

int n;

void insert(Node* &root, int data){
    if(root== nullptr){
        root= newNode(data);
        return;
    }
    if(root->data<=data) {
        insert(root->right, data);
    } else {
        insert(root->left, data);
    }
}

Node* create(int data[], int n) {
    Node* root = newNode(data[0]);
    for(int i=1; i<n; i++) {
        insert(root, data[i]);
    }
    return root;
}

int flag=0, idx=0; // 非BST：0，前序：1，mirror：2
int data[1000];

void preOrder(Node* root) {
    if(root==nullptr){
        return;
    }
    if(root->data!=data[idx]) {
        return;
    }
    if(idx==n-1 && root->data==data[idx]) {
        flag=1;
        return;
    }
    idx++;
    preOrder(root->left);
    preOrder(root->right);
}

void preMirror(Node* root) {
    if(root==nullptr){
        return;
    }
    if(root->data!=data[idx]) {
        return;
    }
    if(idx==n-1 && root->data==data[idx]) {
        flag=2;
        return;
    }
    idx++;
    preMirror(root->right);
    preMirror(root->left);
}

void postOrder(Node* root) {
    if(root== nullptr){
        return;
    }
    if(flag==1) {
        postOrder(root->left);
        postOrder(root->right);
    } else {
        postOrder(root->right);
        postOrder(root->left);

    }
    idx--;
    if(idx<0) {
        cout<<root->data;
    } else {
        cout<<root->data<<' ';
    }
}

int main() {
//     fstream fin;
//     fin.open("tmp4.txt");
//     fin>>n;
//     for(int i=0; i<n; i++) {
//         fin>>data[i];
//     }
   cin>>n;
   for(int i=0; i<n; i++) {
       cin>>data[i];
   }

    Node* root=create(data, n);

    preOrder(root);
    preMirror(root);
    if(flag==0) {
        cout<<"NO";
    } else {
        cout<<"YES"<<endl;
        postOrder(root);
    }

}