PAT (Advanced Level) 1043 Is It a Binary Search Tree （25 分）

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

Code:

#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#pragma warning(disable:4996)

using namespace std;

vector<int> pre, in;
bool ft = true;
int n, cnt = 0;

struct Node
{
	int key;
	Node *lchild, *rchild;
	Node() { lchild = rchild = nullptr; }
};

Node* buildTree_t(int preL, int preR, int inL, int inR) //左闭右开
{
	if (preL >= preR || !ft)
		return nullptr;
	int k = lower_bound(in.begin() + inL, in.begin() + inR, pre[preL]) - in.begin();
	if (k >= inR)
	{
		ft = false;
		return nullptr;
	}
	Node* root = new Node;
	root->key = pre[preL];
	root->lchild = buildTree_t(preL + 1, preL + k - inL + 1, inL, k);
	root->rchild = buildTree_t(preL + k - inL + 1, preL + inR - inL, k + 1, inR);
	return root;
}
Node* buildTree_r(int preL, int preR, int inL, int inR) //左闭右开
{
	if (preL >= preR || !ft)
		return nullptr;
	int k = upper_bound(in.begin() + inL, in.begin() + inR, pre[preL], greater<int>()) - in.begin() - 1;
	if (in[k] != pre[preL])
	{
		ft = false;
		return nullptr;
	}
	Node* root = new Node;
	root->key = pre[preL];
	root->lchild = buildTree_r(preL + 1, preL + k - inL + 1, inL, k);
	root->rchild = buildTree_r(preL + k - inL + 1, preL + inR - inL, k + 1, inR);
	return root;
}

void postorder_traversal(Node* node)
{
	if (node == nullptr)
		return;
	postorder_traversal(node->lchild);
	postorder_traversal(node->rchild);
	cnt++;
	printf("%d%c", node->key, (cnt == n ? '\n' : ' '));
}

int main()
{
	scanf("%d", &n);
	pre.resize(n); in.resize(n);
	for (int i = 0; i < pre.size(); i++)
		scanf("%d", &pre[i]);
	in.assign(pre.begin(), pre.end());
	sort(in.begin(), in.end());
	Node* head = buildTree_t(0, n, 0, n);
	if (ft)
	{
		printf("YES\n");
		postorder_traversal(head);
	}
	else
	{
		ft = true;
		sort(in.begin(), in.end(), [](const int& n1, const int& n2) {
			return n1 > n2;
		});
		head = buildTree_r(0, n, 0, n);
		if (ft)
		{
			printf("YES\n");
			postorder_traversal(head);
		}
		else
		{
			printf("NO\n");
		}
	}
	return 0;
}

思路：

由先序遍历和中序遍历构建二叉树，再后序遍历