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.

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

注意：

1、又是一道重建树的题目，不过已知是二叉搜索树，所以会比1020好入手一点

2、大概的思路是先试着通过递归重建，如果每一个子树不能满足题目中二叉搜索树的三个条件，则终止重建

3、后序序列的输出直接用递归，先左树，再右树，最后根节点

代码：

#include<iostream>
#include<vector>
using namespace std;
struct node
{
	int value;
	node* left;
	node* right;
}root;
vector<int>preorder; //preorder sequence
int n;//number of nodes
int yes=1;//if cannot build, yes=0
int first=1;
void rebuild(int start,int end,node *n, int mode)
{
	(*n).value=preorder[start];
	(*n).left=NULL;
	(*n).right=NULL;
	if(start==end)
		return;
	int rightstart=start+1;
	if(mode==0)//Binary Search Tree
	{
		for(;rightstart<=end;++rightstart)
			if(preorder[rightstart] > (*n).value)
				break;
		//if any element in left tree is no less than root,cannot build
		for(int i=start+1;i<rightstart;++i)
			if(preorder[i]>=(*n).value)
			{yes=0; return;}
		//if any element in right tree is less than root,cannot build
		for(int i=rightstart;i<=end;++i)
			if(preorder[i]<(*n).value)
			{yes=0; return;}
	}
	else//Mirror Image of a BST
	{
		for(;rightstart<=end;++rightstart)
			if(preorder[rightstart] < (*n).value)
				break;
		//if any element in left tree is less than root,cannot build
		for(int i=start+1;i<rightstart;++i)
			if(preorder[i]<(*n).value)
			{yes=0; return;}
		//if any element in right tree is no less than root,cannot build
		for(int i=rightstart;i<=end;++i)
			if(preorder[i]>=(*n).value)
			{yes=0; return;}
	}
	if(rightstart==start+1)
	{ //if only have right tree
		node *right= new node;
		(*n).right=right;
		rebuild(start+1,end,right,mode);
	}
	else if (rightstart==end+1)
	{ //if only have left tree
		node *left= new node;
		(*n).left=left;
		rebuild(start+1,end,left,mode);
	}
	else
	{
		node *left= new node;
		node *right= new node;
		(*n).left=left;
		(*n).right=right;
		rebuild(start+1,rightstart-1,left,mode);
		rebuild(rightstart,end,right,mode);
	}
}
void post_it(node *root)
{//print the postorder sequence
	if(root!=NULL)
	{
		post_it((*root).left);
		post_it((*root).right);
		if(first)//no space printed in front of the first element
			first=0;
		else cout<<' ' ;
		cout<<(*root).value;
	}
	return;
}
int main()
{
	cin>>n;
	for(int i=0;i<n;++i)
	{
		int t;
		cin>>t;
		preorder.push_back(t);
	}
	rebuild(0,n-1,&root,0); //check if it is Binary Search Tree
	if(yes==1)
	{
		cout<< "YES"<<endl;
		post_it(&root);
	}
	else
	{
		yes=1;
		rebuild(0,n-1,&root,1); //check if it is a Mirror Image of Binary Search Tree
		if(yes==1)
		{
			cout<< "YES"<<endl;
			post_it(&root);
		}
		else cout<<"NO" <<endl;
	}        
	return 0;
}