PAT甲级 1043（C++）

代码参考：【题意+分析】1043 Is It a Binary Search Tree (25 分)_来老铁干了这碗代码的博客-CSDN博客

刚开始刷题，这个思路一时半会想不到（悲

#include<iostream>
#include<vector>
using namespace std;
vector<int>preorder;
vector<int>postorder;
vector<int>check;
struct node {
	int element;
	struct node* right;
	struct node* left;
};
void insert(struct node * &  root,int element) {
	if (root == NULL) {
		root = new struct node;
		root->element = element;
		root->right = NULL; root->left = NULL;
		return;
	}
	else if (root->element <= element)
		insert(root->right, element);
	else insert(root->left, element);
}
void pre(struct node* root,int mode) {
	if (root == NULL) return;
	else {
		check.push_back(root->element);
		if (mode == 1) {
			pre(root->left,mode);
			pre(root->right,mode);
		}
		else {
			pre(root->right,mode);
			pre(root->left,mode);
		}
	}
}
void post(struct node * root,int mode) {
	if (root == NULL) return;
	else {
		if (mode == 1) {
			post(root->left, mode); post(root->right, mode);
		}
		else {
			post(root->right, mode); post(root->left, mode);
		}
		postorder.push_back(root->element);
	}
}
int main() {
	int N; cin >> N;
	struct node* root=new struct node;
	for (int i = 1; i <= N; i++) {
		int put; cin >> put; preorder.push_back(put);
		if (i == 1) {
			root->element = put;
			root->left = NULL; root->right = NULL;
		}
		else insert(root, put);
	}
	int flag = 1; int k;
	for (k = 1; k <= 2; k++) {
		check.clear(); pre(root, k);
		for (int i = 0; i < preorder.size(); i++) {
			if (preorder[i] != check[i]) {
				flag = 0;
				break;
			}
			flag = 1;
		}
		if (flag == 1) break;
	}
	if (flag == 0) {
		cout << "NO";
	}
	else {
		post(root,k);
		cout << "YES" << endl;
		for (int i = 0; i < postorder.size(); i++) {
			cout << postorder[i]; 
			if (i != postorder.size() - 1) cout << " ";
		}
	}
	return 0;
}