A1043. 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

要注意，二叉搜索树用数据域和指针域共同表示，包含指针所以用->而不用.。

建树时候比当前值小的插入到左孩子，否则插到右孩子。我当时把大的插入到右孩子否则在左，就不对了。

这个题坑在和pre比较完，输出对应的post。要是prem,输出postm

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;

struct node{
	int data;//数据域
	node *left,*right;//指针域
};

void insert(node* &root,int data)
{
	if(root==NULL)//到达空结点，需要插入的位置
	{
		root=new node;
		root->data=data;
		root->left=root->right=NULL;
		return;
	}
	if(data<root->data)
		insert(root->left,data);
	else insert(root->right,data);
}
//叶子节点地址有，孩子地址为空。root==NULL就是空结点了。
void preOrder(node* root,vector<int>& vi)//先序遍历,结果存在vi
{
	if(root==NULL) return;
	vi.push_back(root->data);
	preOrder(root->left,vi);
	preOrder(root->right,vi);
}

void preOrderMirror(node* root,vector<int>& vi)
{
	if(root==NULL) return;
	vi.push_back(root->data);
	preOrderMirror(root->right,vi);
	preOrderMirror(root->left,vi);
}
void postOrder(node* root,vector<int>& vi){
	if(root==NULL) return;
	postOrder(root->left,vi);
	postOrder(root->right,vi);
	vi.push_back(root->data);
}

void postOrderMirror(node* root, vector<int>& vi){
	if(root==NULL) return;
	postOrderMirror(root->right,vi);
	postOrderMirror(root->left,vi);
	vi.push_back(root->data);
}
vector<int> origin,pre,prem,post,postm;
int main()
{
	freopen("data.in","r",stdin);
	int n,data;
	scanf("%d",&n);
	node* root=NULL;
	for(int i=0;i<n;i++)
	{
		scanf("%d",&data);
		origin.push_back(data);
		insert(root,data);
	}
	preOrder(root,pre);
	preOrderMirror(root,prem);
	postOrder(root,post);
	postOrderMirror(root,postm);
	if(origin==pre)//注意两个vector可以比较是否相等
	{
		printf("YES\n");
		for(int j=0;j<n;j++)
		{
			printf("%d",post[j]);
			if(j!=n-1)
				printf(" ");
			else printf("\n");
		}
	}
	else if(origin==prem)
	{
		printf("YES\n");
		for(int j=0;j<n;j++)
		{
			printf("%d",postm[j]);
			if(j!=n-1)
				printf(" ");
			else printf("\n");
		}
	}
	else printf("NO\n");

	return 0;
}