PAT甲级 -- 1151 LCA in a Binary Tree (30 分)

The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants.

Given any two nodes in a binary tree, you are supposed to find their LCA.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers: M (≤ 1,000), the number of pairs of nodes to be tested; and N (≤ 10,000), the number of keys in the binary tree, respectively. In each of the following two lines, N distinct integers are given as the inorder and preorder traversal sequences of the binary tree, respectively. It is guaranteed that the binary tree can be uniquely determined by the input sequences. Then M lines follow, each contains a pair of integer keys U and V. All the keys are in the range of int.

Output Specification:

For each given pair of U and V, print in a line LCA of U and V is A. if the LCA is found and A is the key. But if A is one of U and V, print X is an ancestor of Y. where X is A and Y is the other node. If U or V is not found in the binary tree, print in a line ERROR: U is not found. or ERROR: V is not found. or ERROR: U and V are not found..

Sample Input:

6 8
7 2 3 4 6 5 1 8
5 3 7 2 6 4 8 1
2 6
8 1
7 9
12 -3
0 8
99 99

Sample Output:

LCA of 2 and 6 is 3.
8 is an ancestor of 1.
ERROR: 9 is not found.
ERROR: 12 and -3 are not found.
ERROR: 0 is not found.
ERROR: 99 and 99 are not found.

我的思路：

1. 初看这道题，打算把树建出来，然后递归寻找

2. 下午补自己再写一遍的代码：

自己又照着这个思路写了一遍，出问题出在了考虑一边一个的时候只考虑了一个地方

#include <iostream>
#include <map>
#include <vector>
using namespace std;

map<int, int> pos;
int M, N;
vector<int> inorder;
vector<int> preorder;

void LCA(int inl, int inr, int preRoot, int u, int v){
	if (inl > inr) return;
	int inRoot = pos[preorder[preRoot]], uIN = pos[u], vIN = pos[v];
	if (uIN < inRoot && vIN < inRoot)
		LCA(inl, inRoot-1, preRoot+1,u,v);
	else if((uIN < inRoot && vIN > inRoot) || (uIN > inRoot && vIN < inRoot))  //这个地方注意！！
		printf("LCA of %d and %d is %d.\n", u, v, inorder[inRoot]);
	else if(uIN > inRoot && vIN > inRoot)
		LCA(inRoot+1, inr, preRoot+1+(inRoot - inl), u, v);
	else if(uIN == inRoot)
		printf("%d is an ancestor of %d.\n",u, v);
	else if(vIN == inRoot)
		printf("%d is an ancestor of %d.\n",v, u);

}
int main(){
	scanf("%d %d", &M, &N);
	inorder.resize(N+1), preorder.resize(N+1);
	for (int i = 1; i <= N; i++){
		scanf("%d", &inorder[i]);
		pos[inorder[i]] = i;
	}
	for (int i = 1; i <= N; i++) scanf("%d", &preorder[i]);
	int u, v;
	for (int i = 0; i < M; i++){
		scanf("%d %d", &u, &v);
		if (pos[u] == 0 && pos[v] == 0){
			printf("ERROR: %d and %d are not found.\n", u, v);
		}else if(pos[u] == 0 || pos[v] == 0){
			printf("ERROR: %d is not found.\n", pos[u] == 0? u:v);
		}else{
			LCA(1,N,1,u, v);
		}
	}


	return 0;
};

 

柳神代码：

看了柳神的代码说不用建树：

1. 如果a、b同在左子树，根据树递归的性质，递归在左子树中继续找

2. 如果a、b正好一个在左边，一个在右边，则当前根节点就是共同祖先

3. 如果a、b同在右子树，递归在右子树中继续找

4. 正好某一个是另一个的祖先，则直接打印

5. 对不存在的结点的处理方法是 ： 用pos map，记录中序中各个key所对应的下标。如果该值下标为0，说明不存在

 

pos数组这点要学习，可以快速找到先序中根节点在中序中的位置！很棒！！

#include <iostream>
#include <vector>
#include <map>
using namespace std;
map<int, int> pos;
vector<int> in, pre;
void lca(int inl, int inr, int preRoot, int a, int b) {
	if (inl > inr) return;
	int inRoot = pos[pre[preRoot]], aIn = pos[a], bIn = pos[b];
	if (aIn < inRoot && bIn < inRoot)  //a、b都在左子树中
		lca(inl, inRoot-1, preRoot+1, a, b);  //递归在左子树中找
	else if ((aIn < inRoot && bIn > inRoot) || (aIn > inRoot && bIn < inRoot))  //a、b在两边，祖先正好是当前根
		printf("LCA of %d and %d is %d.\n", a, b, in[inRoot]);
	else if (aIn > inRoot && bIn > inRoot)  //a、b都在右子树中
		lca(inRoot+1, inr, preRoot+1+(inRoot-inl), a, b);  //递归在右子树中找
	else if (aIn == inRoot) 
		printf("%d is an ancestor of %d.\n", a, b);
	else if (bIn == inRoot)
		printf("%d is an ancestor of %d.\n", b, a);
}
int main() {
	int m, n, a, b;
	scanf("%d %d", &m, &n);
	in.resize(n + 1), pre.resize(n + 1);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &in[i]);
		pos[in[i]] = i; //记录是否出现过
	}
	for (int i = 1; i <= n; i++) scanf("%d", &pre[i]);
	for (int i = 0; i < m; i++) {
		scanf("%d %d", &a, &b);
		if (pos[a] == 0 && pos[b] == 0)
			printf("ERROR: %d and %d are not found.\n", a, b);
		else if (pos[a] == 0 || pos[b] == 0)
			printf("ERROR: %d is not found.\n", pos[a] == 0 ? a : b);
		else
			lca(1, n, 1, a, b);
	}
	return 0;
}