【PAT】A1043 Is It a Binary Search Tree

题目

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

思路

本题没有告诉你每个节点的孩子节点有哪些，因为是需要自己插入的，所以我没有使用静态二叉树实现，也许可以但是我不会，只好老老实实用指针，根据二叉搜索树的定义插入后，对它进行前序遍历，镜像树的前序遍历就是把根左右改成根右左，后序遍历同理。本题还让我知道了vector容器也能比较大小…

代码

#include<bits/stdc++.h>
using namespace std;
int n;
struct node{
	int key;
	node* lchild;
	node* rchild;
};
vector<int> tree,pre,prem,post,postm;
node* newnode(int x)
{
	node* root=new node;
	root->key=x;
	root->lchild=NULL;
	root->rchild=NULL;
	return root;
}
void insert(node* &root,int x)
{
	if(root==NULL)
	{
		root=newnode(x);
		return ;
	}
	else if(root->key>x){
		insert(root->lchild,x);
	}
	else{
		insert(root->rchild,x);
	}
}
void preorder(node* root)
{
	if(root==NULL) return;
	pre.push_back(root->key);
	preorder(root->lchild);
	preorder(root->rchild);
}
void preorderm(node* root)
{
	if(root==NULL) return;
	prem.push_back(root->key);
	preorderm(root->rchild);
	preorderm(root->lchild);
}
void postorder(node* root)
{
	if(root==NULL) return;
	postorder(root->lchild);
	postorder(root->rchild);
	post.push_back(root->key);
}
void postorderm(node* root)
{
	if(root==NULL) return;
	postorderm(root->rchild);
	postorderm(root->lchild);
	postm.push_back(root->key);
}
int main()
{
	cin>>n;
	tree.resize(n);
	node* root=NULL;
	for(int i=0;i<n;i++)
	{
		cin>>tree[i];
		insert(root,tree[i]);
	}
	preorder(root);
	preorderm(root);
	if(tree==pre)
	{
		cout<<"YES"<<endl;
		postorder(root);
		for(int i=0;i<n;i++)
		{
			cout<<post[i];
			if(i<n-1) cout<<" ";
		}
	}
	else if(tree==prem)
	{
		cout<<"YES"<<endl;
		postorderm(root);
		for(int i=0;i<n;i++)
		{
			cout<<postm[i];
			if(i<n-1) cout<<" ";
		}
	}
	else{
		cout<<"NO";
	}
}