1043 Is It a Binary Search Tree (25 分) BST反转？不反转遍历+vector

1043 Is It a Binary Search Tree (25 分)

与A1102好好对比，都是反转树

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

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;const int maxn = 1010;vector<int> origin, pre, premirror, post, postmirror;struct node {int data;node* lchild;node* rchild;
};void insert(node* &root, int data) {//注意&if (root == NULL) {root = new node;root->data = data;root->lchild = root->rchild = NULL;//别忘了return;}if (data < root->data)insert(root->lchild, data);else insert(root->rchild, data);
}//构建一个BSTvoid preorder(node* root, vector<int>&vi) {//先序遍历构造好的BST并且插入vectorif (root == NULL)return;vi.push_back(root->data);preorder(root->lchild, vi);preorder(root->rchild, vi);}
void preordermirror(node* root, vector<int>&vi) {//先序遍历构造好的BST并且插入vectorif (root == NULL)return;vi.push_back(root->data);preordermirror(root->rchild, vi);preordermirror(root->lchild, vi);}void postorder(node* root, vector<int>&vi) {if (root == NULL)return;postorder(root->lchild, vi);postorder(root->rchild, vi);vi.push_back(root->data);
}
void postordermirror(node* root, vector<int>&vi) {//这里一定要用&if (root == NULL)return;postordermirror(root->rchild, vi);//这里不用&postordermirror(root->lchild, vi);vi.push_back(root->data);
}int main() {int n,data;scanf("%d", &n);node* root =NULL;//切记for (int i = 0; i < n; i++) {scanf("%d", &data);origin.push_back(data);insert(root,data);}preorder(root, pre);preordermirror(root, premirror);postorder(root, post);postordermirror(root, postmirror);if (origin == pre) {printf("YES\n");for (int i = 0; i < n; i++) {printf("%d", post[i]);if (i < n - 1)printf(" ");}}else if (origin == premirror) {printf("YES\n");for (int i = 0; i <n; i++) {printf("%d", postmirror[i]);if (i <n-1)printf(" ");}}else printf("NO\n");return 0;}