A1043 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.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer N (≤1000). Then N integer keys are given in the next line. All the numbers in a line are separated by a space.

Output Specification:

For each test case, first print in a line YES if the sequence is the preorder traversal sequence of a BST or the mirror image of a BST, or NO if not. Then if the answer is YES, print in the next line the postorder traversal sequence of that tree. All the numbers in a line must be separated by a space, and there must be no extra space at the end of the line.

Sample Input 1:

7
8 6 5 7 10 8 11

Sample Output 1:

YES
5 7 6 8 11 10 8

Sample Input 2:

7
8 10 11 8 6 7 5

Sample Output 2:

YES
11 8 10 7 5 6 8

Sample Input 3:

7
8 6 8 5 10 9 11

Sample Output 3:

NO

题意：

 给出N个正整数作为一颗二叉排序树的插入节点顺序，问这串序列是否是该二叉排序树的先序序列或该二叉排序树的镜像树的先序序列。所谓镜像树就是交换二叉树的所有节点的左右子树。如果是，则输出YES，并输出对应的树（二叉排序树或者二叉排序树的镜像树这两种情况）的后序序列。否则输出NO。

思路：

镜像树的先序遍历，就是先序遍历时交换左右子树的访问顺序即可

镜像树的后序遍历，也是交换左右子树的访问顺序

采用vector存储初始序列、先序序列，方便相互之间的比较，如果采用数组，还要使用循环实现

注意：

1. 定义根节点时将其初始化为空节点（一开始是没有元素的）；新建节点时注意将其左右节点地址设为NULL

#include <cstdio>
#include <vector>
using namespace std;
struct node{
    int data;
    node *right, *left;
};
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, vector<int>& vi){     //vi中存储先序遍历的结果
    if(root == NULL)
        return;
    vi.push_back(root->data);
    preOrder(root->left, vi);
    preOrder(root->right, vi);
}
//镜像树先序遍历
void preOrderMirror(node* root, vector<int>& vi){
    if(root == NULL)
        return;
    vi.push_back(root->data);
    preOrderMirror(root->right, vi);
    preOrderMirror(root->left, vi);
}
void postOrder(node* root, vector<int>& vi){
    if(root == NULL)
        return;
    postOrder(root->left, vi);
    postOrder(root->right, vi);
    vi.push_back(root->data);
}
//镜像树后序遍历
void postOrderMirror(node* root, vector<int>& vi){
    if(root == NULL)
        return;
    postOrderMirror(root->right, vi);
    postOrderMirror(root->left, vi);
    vi.push_back(root->data);
}
vector<int> origin, pre, preM, post, postM;
int main(){
    int n, data;
    node* root = NULL;      //定义头结点
    scanf("%d", &n);
    for(int i = 0; i < n; i++){
        scanf("%d", &data);
        origin.push_back(data);
        insert(root, data);
    }
    preOrder(root, pre);
    preOrderMirror(root, preM);
    postOrder(root, post);
    postOrderMirror(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\n");
    return 0;
}