PAT A1043 is it a binary search tree (25)

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int MAX=1010;
int n;
vector<int> post,bstpree;
int pre[MAX];
struct node{
	int num;
	node* lchild;
	node* rchild;
};
node* newnode(int x){
	node* Node = new node;
	Node->num=x;
	Node->lchild=Node->rchild=NULL;
	return Node;
}
node* insert(node* &root,int x){
	if(root==NULL){
		root=newnode(x);
		return root;
	}else if(x<root->num) insert(root->lchild,x);
	else if(x>=root->num) insert(root->rchild,x);
	return root;
}


void pretaver(node* root){
	if(root->num==NULL) return;
	else bstpree.push_back(root->num);
	if(root->lchild!=NULL) pretaver(root->lchild);
	if(root->rchild!=NULL) pretaver(root->rchild);
	
}

void preMtaver(node* root){
	if(root->num==NULL) return;
	else bstpree.push_back(root->num);
	
	if(root->rchild!=NULL) preMtaver(root->rchild);
	if(root->lchild!=NULL) preMtaver(root->lchild);
}
void posttraver(node* root){
	
	if(root->lchild!=NULL) posttraver(root->lchild);
	if(root->rchild!=NULL) posttraver(root->rchild);
	if(root->num==NULL) return;
	else post.push_back(root->num);
}
void postMtraver(node* root){
	if(root->rchild!=NULL) postMtraver(root->rchild);
	if(root->lchild!=NULL) postMtraver(root->lchild);
	
	if(root->num==NULL) return;
	else post.push_back(root->num);
}
int issame(vector<int> pree){
	for(int i=0;i<n;i++){
		if(pree[i]!=pre[i]) return 0;
	}
	return 1;
}

void print(vector<int> pree){
	for(int i=0;i<n;i++){
		if(i<n-1) printf("%d ",post[i]);
		else printf("%d\n",post[i]);
	}
}
int main(){
	scanf("%d",&n);
	int i;
	node* root=NULL;
	for(i=0;i<n;i++){
		scanf("%d",&pre[i]);
		insert(root,pre[i]);
	}
	pretaver(root);
	if(issame(bstpree)==1){
		printf("YES\n");
		posttraver(root);
		print(post);
	}else{
		bstpree.clear();
		preMtaver(root);
		if(issame(bstpree)==1){
				printf("YES\n");
				postMtraver(root);
				print(post);
		
		}else printf("NO\n");
		
	}
	system("pause");
	return 0;
}