PAT（Advanced） 1043 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.

解答：

该题的思路一是通过建树的方法来解决，另一种是模拟，前一种解法简介易懂思路明确，故选用前者。 

（1）题目说输入的一串数是一个BST或镜像BST的先序遍历，因此我们就按照二叉树的先序遍历来建BST;

（2）记录下BST先序遍历的串和镜像BST现需遍历的串;

（3）再和输入的顺序比较，如果相同，那么就YES，否则只能是NO;

（4）如果是YES，就后序遍历，得到一个输出串。

AC代码如下：

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

vector<int> pre, mpre, post, mpost;

typedef struct Node{
	int data;
	struct Node *lchild, *rchild;
}Node, *Tree;

void insertBST(Tree& root, int x)
{
	if(root == NULL)
	{
		root = new Node;
		root->data = x;
		root->lchild = root->rchild = NULL;
	}
	else if(root->data > x)
	{
		insertBST(root->lchild, x);
	}else{
		insertBST(root->rchild, x);
	}
}

Node* buildBST(vector<int>& vec)
{
	Node* root = NULL;
	
	for(int i = 0; i < vec.size(); ++i)
	{
		insertBST(root, vec[i]);
	}
	return root;
}

void preOrder(const Tree& root)
{
	if(root != NULL){
		pre.push_back(root->data);
		preOrder(root->lchild);
		preOrder(root->rchild);
	}
}
void mpreOrder(const Tree& root)
{
	if(root != NULL)
	{
		mpre.push_back(root->data);
		mpreOrder(root->rchild);
		mpreOrder(root->lchild);	
	}
}
void postOrder(const Tree& root)
{
	if(root != NULL)
	{
		postOrder(root->lchild);
		postOrder(root->rchild);
		post.push_back(root->data);
	}
}
void mpostOrder(const Tree& root)
{
	if(root != NULL)
	{
		mpostOrder(root->rchild);
		mpostOrder(root->lchild);
		mpost.push_back(root->data);
	}
}
void print(const vector<int>& v)
{
	int first = 1;
	
	for(int i = 0; i < v.size(); ++i)
	{
		if(first == 1)
		{
			printf("%d", v[i]);
			first = 0;	
		}	
		else
			printf(" %d", v[i]);
	} 
} 

int main()
{
	int n;
	bool islowfirst = true;
	
	scanf("%d", &n);
	vector<int> vec(n);
	for(int i = 0; i < n; ++i)
	{
		scanf("%d", &vec[i]);
	}

	//判定该先序遍历是否是二叉搜索树或者镜像二叉搜索树
	Tree root = buildBST(vec);
	preOrder(root);
	mpreOrder(root);
	postOrder(root);
	mpostOrder(root);

	if( equal(vec.begin(), vec.end(), pre.begin()) )
	{
		printf("YES\n");
		print(post);
	}
	else if( equal(vec.begin(), vec.end(), mpre.begin()) )
	{
		printf("YES\n");
		print(mpost);
	}
	else
	{
		printf("NO\n");
	}
	return 0;
}