1143 Lowest Common Ancestor (30 分)--PAT甲级(LCA)

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.

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.
Given any two nodes in a BST, 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 BST, respectively. In the second line, N distinct integers are given as the preorder traversal sequence of the BST. 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 BST, 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
6 3 1 2 5 4 8 7
2 5
8 7
1 9
12 -3
0 8
99 99
结尾无空行
Sample Output:
LCA of 2 and 5 is 3.
8 is an ancestor of 7.
ERROR: 9 is not found.
ERROR: 12 and -3 are not found.
ERROR: 0 is not found.
ERROR: 99 and 99 are not found.
结尾无空行

题目分析：题目大意是给出一颗二叉搜索树，要求找出任意两个树的最小祖先节点。
我自己的思路是建树，通过二叉树的搜索先找到两个节点，接着通过找父亲节点，找到共同节点。
感觉是否思路过于复杂，看了下柳婼的代码，只能惊叹妙，写代码这事情真的要看天赋。
她只是用了一个一维数组pre，接着判断u,v是否在pre的两侧。
为什么找到的第一个符合要求的就一定是最低的公共祖先？
前序的特点根-左-右，那么u,v一定是在根的两侧。
u,v都大于根，那么根需要向右走(根变大)
u,v都小于根，那么根需要向左走(根变小)

柳神代码：

#include<iostream>
#include<map>
#include<vector>
using namespace std;
map<int, bool> mp;
int main(){
	int m, n, u, v, a;
	cin >> m >> n;
	vector<int> pre(n);
	for(int i = 0; i < n; i ++){
		cin >> pre[i];
		mp[pre[i]] = true;
	}
	for(int i = 0; i < m; i ++){
		cin >> u >> v;
		for(int i = 0; i < n; i ++){
			a = pre[i];
			if((a > u && a < v) || (a > v && a < u) || (a == u) || (a ==v))break; 
		}
		if(mp[u] == false && mp[v] == false)
			printf("ERROR: %d and %d are not found.\n", u, v);
		else if(mp[u] == false || mp[v] == false)
			printf("ERROR: %d is not found.\n", mp[u] == false ? u : v);
		else if(a == u || a == v)
			printf("%d is an ancestor of %d.\n", a, a == u ? v : u);
		else
			printf("LCA of %d and %d is %d.\n", u, v, a);
	}
	return 0;
}