PAT 1143 Lowest Common Ancestor（30 分）C++

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.

Approach

1. 二叉查找树中查找公共祖先的一道题，这道题不难，可以根据二叉搜索树的性质，一下子找到公共祖先，因为二叉树搜索树是左子树所有结点小于根节点，右子树所有结点大于根结点，那么公共祖先必然是恰好大于一个子节点，小于另一个子节点，所以根据这个性质，就可以很容易解决。
2. 这道题我一开始用我是直接插入建树，没想到一直卡两个点，一直在优化其他地方，最后看了其他人的解法，才明白自己建树的地方太慢了，基础不牢，不知道插入建树慢于直接建树的，最后改为直接建树就过了最后两个点，惭愧。

Code

struct TreeNode{
    TreeNode* right;
    TreeNode* left;
    int value;
    TreeNode(int e){
        value = e;
        right = nullptr;
        left = nullptr;
    }
};
void find(int a,int b,TreeNode* head,int &target) {
    if (head == nullptr)return;
    if (head->value >= a&&head->value <= b) {
        target = head->value;
        return;
    }
    if (head->value <= a)find(a, b, head->right, target);
    if (head->value >= b)find(a, b, head->left, target);
}
TreeNode* CreateTree(vector<int> &pre,vector<int> &in,int preL,int preR,int inL,int inR) {
    if (preL > preR)return nullptr;
    TreeNode* root = new TreeNode(pre[preL]);
    int k=inL;
    for (int i = inL; i <= inR; i++) {
        if (pre[preL] == in[i]) {
            k = i;
            break;
        }
    }
    int leftnumber = k - inL;
    root->left = CreateTree(pre,in,preL + 1, preL + leftnumber, inL, k - 1);
    root->right = CreateTree(pre,in,preL + leftnumber+1, preR, k + 1, inR);
    return root;
}
int main() {
    int M, N;
    scanf("%d%d", &M, &N);
    unordered_map<int, bool>unmp;
    vector<int>pre(N, 0);
    vector<int>in(N, 0);
    for (int i = 0; i < N; i++) {
        scanf("%d", &pre[i]);
        in[i] = pre[i];
        unmp[pre[i]] = true;
    }
    sort(in.begin(), in.end());
    TreeNode* head=CreateTree(pre,in,0, N - 1, 0, N - 1);
    for (int i = 0; i < M; i++) {
        int a, b;
        scanf("%d%d", &a, &b);
        auto founda = unmp[a];
        auto foundb = unmp[b];
        if (!founda&&!foundb) {
            printf("ERROR: %d and %d are not found.\n", a, b);
            continue;
        }
        else if (!founda) {
            printf("ERROR: %d is not found.\n", a);
            continue;
        }
        else if (!foundb) {
            printf("ERROR: %d is not found.\n", b);
            continue;
        }
        else
        {
            int target = -2147483647;
            if(a<b)
            find(a, b, head, target);
            else 
            find(b, a, head, target);
            if (target == a) {
                printf("%d is an ancestor of %d.\n", target, b);
            }
            else if (target == b) {
                printf("%d is an ancestor of %d.\n", target, a);
            }
            else {
                printf("LCA of %d and %d is %d.\n", a, b, target);
            }
        }
    }
    return 0;
}