PTA甲级考试真题练习43——1043 Is It a Binary Search Tree

题目

思路

这题是1020 Tree Traversals的升级版：
1020是根据后序和中序遍历序列求出生成树并且层序输出
这题是根据前序和中序遍历序列求出生成树并且后序输出

首先题目要求是二叉查找树，就是隐性的告诉我们中序遍历的结果是个非递减序列或者非递增序列，我们可以通过比较前序序列的前两个元素知道是非递减序列还是非递增序列
这样我们就可以通过前序遍历和中序遍历得到生成树（生成过程中如果查找不到对应结点说明不能生成二叉搜索树，返回false）
然后再后序遍历输出即可
注意：求非递减和非递增序列的查找函数不一样！！因为题目规定有与当前结点相同的结点在结点的右子树上，那么镜像后就在左子树上，所以一个顺序查找一个倒序查找

代码

#include <iostream>
#include <string>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<list>
#include<sstream>
#include<string.h>
#include<math.h>
using namespace std;
#define nmax 54
#define inf 999999
vector<int> preorder;
typedef struct Node
{
	int key;
	Node* lchild, *rchild;
}Node,*Tree;
bool first = true;

int FindIndex1(int num,vector<int> vec) {
	for (int i = 0; i < vec.size(); ++i) {
		if (vec[i] == num)
			return i;
	}
	return -1;
}
int FindIndex2(int num, vector<int> vec) {
	for (int i = vec.size()-1; i >=0; --i) {
		if (vec[i] == num)
			return i;
	}
	return -1;
}
bool cmp(int& a, int& b) {
	return a > b;
}

bool SpanTree(Tree& tree,int index,int NType,vector<int> inorder,int((*p)(int,vector<int>))) {
	Node* newnode;
	if (NType == 0) {
		tree = (Node*)malloc(sizeof(Node));
		tree->lchild = tree->rchild = nullptr;
		tree->key = preorder[index];
		newnode = tree;
	}
	//如果是左边结点
	else if (NType == 1){
		newnode = (Node*)malloc(sizeof(Node));
		newnode->lchild = newnode->rchild = nullptr;
		newnode->key = preorder[index];
		tree->lchild = newnode;
	}
	//如果是右边结点
	else{
		newnode = (Node*)malloc(sizeof(Node));
		newnode->lchild = newnode->rchild = nullptr;
		newnode->key = preorder[index];
		tree->rchild = newnode;
	}
	int curindex = p(preorder[index],inorder);
	if (curindex == -1)
		return false;
	int leftLen = curindex;
	vector<int> left;
	vector<int> right;
	left.assign(inorder.begin(), inorder.begin() + curindex);
	right.assign(inorder.begin() + curindex + 1, inorder.end());
	if (!left.empty())
		if (!SpanTree(newnode, index + 1, 1, left, p))
			return false;
	if (!right.empty())
		if (!SpanTree(newnode, index + leftLen + 1, 2, right, p))
			return false;
	return true;
}

void DFS(Tree& tree) {
	if(tree->lchild!=nullptr)
		DFS(tree->lchild);
	if(tree->rchild!=nullptr)
		DFS(tree->rchild);
	if (first) {
		cout << tree->key;
		first = false;
	}
	else
		cout << " " << tree->key;
}

int main()
{
	int n;
	vector<int> inorder;
	cin >> n;
	for (int i = 0; i < n; ++i) {
		int tmp;
		cin >> tmp;
		preorder.emplace_back(tmp);
		inorder.emplace_back(tmp);
	}	
	Tree tree;
	bool can = false;
	if (preorder[0] > preorder[1]) {
		sort(inorder.begin(), inorder.end());
		can = SpanTree(tree, 0, 0, inorder,FindIndex1);
	}
	else {
		sort(inorder.begin(), inorder.end(),cmp);
		can = SpanTree(tree, 0, 0, inorder,FindIndex2);
	}
	if (can) {
		cout << "YES" << endl;
		//输出
		DFS(tree);
	}
	else
		cout << "NO";
}