PAT (Advanced Level)-1143 Lowest Common Ancestor

1143 Lowest Common Ancestor（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.

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.

思路：BST 已知前序 排序得到中序 进行建树 （链式）

递归下去找两个节点 再固定两个的位置 从跟结点出发找一个公共结点，该公共结点根据题意 值应当尽量小

#include <iostream>
#include <algorithm>
using namespace std;

struct node
{
	int data;
	node *lchild, *rchild;
};
node*buildtree(int preL, int preR, int inoL, int inoR, int *pre, int *ino)
{
	if (preL > preR)return NULL;
	int e = pre[preL], idx = inoL;
	while (idx<=inoR && e != ino[idx])idx++;
	node*root = new node;
	root->data =e;
	root->lchild = root->rchild = NULL;
	int leftLength = idx - inoL;
	int leftPreEnd = leftLength + preL;
	root->lchild = buildtree(preL + 1, leftPreEnd, inoL, idx - 1, pre, ino);
	root->rchild = buildtree(leftPreEnd + 1, preR, idx + 1, inoR, pre, ino);
	return root;

}
node*search(node *root, int val)
{
	while (root)
	{
		if (root->data > val)root=root->lchild;
		else if (root->data < val)root=root->rchild;
		else return root;
	}
	return root;
}
node *LCA(node *root, node*x, node*y)
{
	while( (root->data - x->data)*(root->data - y->data)>0)
	{
		root = root->data < x->data ? root->rchild : root->lchild;
	}
	return root;
}
int main()
{
	int m, n;
	cin >> m >> n;
	int *pre = new int[n+1];
	int *ino = new int[n+1];
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &pre[i]);
		ino[i] = pre[i];
	}
	sort(ino, ino + n);
	node*root = buildtree(0, n - 1, 0, n - 1, pre, ino);

	while (m--)
	{
		int u, v;
		scanf("%d %d", &u, &v);
		node*x = search(root, u);
		node*y= search(root, v);
		if (!x && !y)printf("ERROR: %d and %d are not found.\n", u, v);
		else if(!(x&&y))printf("ERROR: %d is not found.\n",x?v:u);
		else 
		{
			node*res = LCA(root, x, y);
			if (res == x)printf("%d is an ancestor of %d.\n", u, v);
			else if(res==y)printf("%d is an ancestor of %d.\n", v,u);
			else printf("LCA of %d and %d is %d.\n", u, v, res->data);

		}
	}
}