1143. Lowest Common Ancestor

Lowest Common Ancestor

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 (<= 1000), the number of pairs of nodes to be tested; and N (<= 10000), 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的性质和前序序列可以直接把树重建。

首先判断两结点是否在树中，为了节省时间，直接在读入前序序列的时候用hash标记每一个结点，则查询时间只有$O(1)$(这里试过如果直接从根节点开始查找，复杂度为$O(logn)$，有一个测试点会超时)。这里有一个小技巧：当直接用bool类型的数组作为散列表范围不够时，不要忘了用map< int, bool >来作为散列表的容器。

找到公共祖先可以采取以下方法(前提是两个结点a和b都在树中): 记当前根结点为x，如果 a < x 且 b > x (或相反)，则说明x即要求的祖先；如果a，b都小于(大于)x，说明也要继续向左(右)子树查找；如果 x == a(b)，说明a(b)就是b(a)的祖先。

代码实现

#include <cstdio>
#include <vector>
#include <cstring>
#include <map>
using namespace std;

map<int, bool> hashTable;       // 标记树中元素

struct node
{
    int data;
    node *lchild, *rchild;
};

/* 新建结点 */
node* newNode(int x)
{
    node* root = new node;
    root->data = x;
    root->lchild = root->rchild = NULL;
    return root;
}

/* 插入结点 */
void insertBST(node* &root, int x)
{
    if (root == NULL)
    {
        root = newNode(x);
        return;
    }

    if (x < root->data)
        insertBST(root->lchild, x);
    else
        insertBST(root->rchild, x);
}

/* 创建BST */
node* createBST(vector<int> pre)
{
    node* root = NULL;
    for (int i = 0; i < pre.size(); i++)
        insertBST(root, pre[i]);
    return root;
}

/* 查找公共祖先 */
int findRoot(node* root, int a, int b)
{
    // a，b结点在根结点左右两侧，说明该根结点就是公共祖先
    if (a < root->data && b > root->data || a > root->data && b < root->data)
        return root->data;
    
    // a(b)即是b(a)的祖先
    if (root->data == a || root->data == b)
        return root->data;
    
    // 继续向左右子树查找
    if (a < root->data && b < root->data)
        return findRoot(root->lchild, a, b);
    else if (a > root->data && b > root->data)
        return findRoot(root->rchild, a, b);
}

int main()
{
    int m, n, a, b;
    vector<int> pre;

    scanf("%d %d", &m, &n);
    for (int i = 0; i < n; i++)
    {
        int x;
        scanf("%d", &x);
        hashTable[x] = true;        // 标记树中结点
        pre.push_back(x);
    }

    node* root = createBST(pre);    // 创建BST

    for (int i = 0; i < m; i++)
    {
        scanf("%d %d", &a, &b);

        bool findA = hashTable[a];
        bool findB = hashTable[b];

        // a，b不在树中的情况
        if (!findA && !findB)
        {
            printf("ERROR: %d and %d are not found.\n", a, b);
            continue;
        }
        else if (!findA)
        {
            printf("ERROR: %d is not found.\n", a);
            continue;
        }
        else if (!findB)
        {
            printf("ERROR: %d is not found.\n", b);
            continue;
        }

        // a，b都在树中的前提下，查找公共祖先
        int ans = findRoot(root, a, b);
        if (ans == a)
            printf("%d is an ancestor of %d.\n", a, b);
        else if (ans == b)
            printf("%d is an ancestor of %d.\n", b, a);
        else
            printf("LCA of %d and %d is %d.\n", a, b, ans);
    }

    return 0;
}