题意:给定一颗二叉搜索树的前序遍历,然后求任意给定两个节点的最小共同祖先节点,若不存在就直接打印不存在。
思路:把该二叉搜索树的前序存储起来,然后进行遍历,遍历过程就在找寻介于要查找两节点之间的树,因为对于任意两个节点而言,并且该树是一颗二叉搜索树,所以先序遍历就在找介于两者之间的节点,两者最小的祖先节点必定处于两数之间或者等于其中某一个。找到介于两者之间就进对该点进行判断,是否存在于该数中,是否等于其中某个点,
代码:
#include<iostream>
#include<vector>
#include<map>
using namespace std;
int m, n, a, b,tem;
int main() {
map<int, bool> mp;
cin >> m >> n;
vector<int> pre(n);
for (int i = 0; i < n; i++) {
scanf("%d", &pre[i]);
mp[pre[i]] = true;
}
for (int i = 0; i < m; i++) {
scanf("%d%d", &a, &b);
for (int j = 0; j < n; j++) {//对于一颗二叉搜索树而言,介于两数之间或者等于两数一定为该两点的最低共同祖先
tem = pre[j];
if ((tem >= a && tem <= b) || (tem >= b && tem <= a))break;
}
if (mp[a] == false && mp[b] == false) {
printf("ERROR: %d and %d are not found.\n", a, b);
}
else if (mp[a] == false || mp[b] == false) {
printf("ERROR: %d is not found.\n", mp[a] == false ? a : b);
}
else if (tem == a || tem == b) {
printf("%d is an ancestor of %d.\n",tem,tem==a?b:a);
}
else {
printf("LCA of %d and %d is %d.\n",a,b,tem);
}
}
system("pause");
return 0;
}