【PAT】A1043 Is It a Binary Search Tree **-CSDN博客

本文探讨了如何通过给定的整数序列判断其是否为二叉搜索树(BST)或其镜像树的先序遍历。文章详细介绍了BST的性质及其镜像树的概念，并提供了一种算法来识别这些序列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

总结：

题目本身并不是很困难，但是还是花了一个多小时去写，走了很多弯路，借助宝典才攻克
时间长且出了问题后借助宝典找思路的主要原因在于不够熟练，但是考试快开始了，其实时间也不是很多了
这个题目中比较巧妙的是：在先序后序的遍历中，交换左右子树遍历的顺序就达到了镜像树的目的，学习到了。
对模块的写法不够熟练，要加强训练

代码：

#include <stdio.h>
#include <vector>
using namespace std;
struct Node{
	int data;
	Node *lchild,*rchild;
};
int total;
vector<int > tree,pre,preM,post,postM;
Node* newNode(int x){
	Node* node=new Node; //创建一个新的结点
	node->data=x;  //给新节点赋值
	node->lchild=node->rchild=NULL;  //设置新节点左右两边均为空 
	return node; 
}

void insert(Node* &root,int x){
	if(root==NULL){ //为空
		root=newNode(x);
		return; 
	}else if(root->data>x){  //结点的值大于等于x，往左，进入左子树 
		insert(root->lchild,x);
	}else{  //结点的值小于x 
		insert(root->rchild,x); 
	} 
}

void preorder(Node* root,vector<int> &vi){  //正常树的先序 
	if(root==NULL){
		return;
	}
	vi.push_back(root->data);
	preorder(root->lchild,vi);
	preorder(root->rchild,vi);
} 

void preorderM(Node* root,vector<int> &vi){  //镜像树的先序 
	if(root==NULL){
		return;
	}
	vi.push_back(root->data);
	preorderM(root->rchild,vi);
	preorderM(root->lchild,vi);
	
}

void postorder(Node* root,vector<int> &vi){  //正常树的后序 
	if(root==NULL){
		return;
	}
	postorder(root->lchild,vi);
	postorder(root->rchild,vi);
	vi.push_back(root->data);
} 

void postorderM(Node* root,vector<int> &vi){  //镜像树的后序 
	if(root==NULL){
		return;
	}
	postorderM(root->rchild,vi);
	postorderM(root->lchild,vi);
	
	vi.push_back(root->data);
}  



int main(){
	int temp;
	Node* root=NULL;
	scanf("%d",&total);
	for(int i=0;i<total;i++){
		scanf("%d",&temp);
		tree.push_back(temp);
		insert(root,temp);
	}
	preorder(root,pre);
	preorderM(root,preM); //镜像的先序 
	postorder(root,post);
	postorderM(root,postM);
	if(tree==pre){
		printf("YES\n");
		for(int i=0;i<post.size();i++){
			printf("%d",post[i]);
			if(i<total-1) printf(" ");
		}
	}else if(tree==preM){
		printf("YES\n");
		for(int i=0;i<postM.size();i++){
			printf("%d",postM[i]);
			if(i<total-1) printf(" ");
		}
	}else{
		printf("NO\n");
	}
	return 0;
}