1143 Lowest Common Ancestor (30 分) 二叉搜索树（BST）两节点的最近共同祖先

最新推荐文章于 2020-12-12 22:02:41 发布

原创最新推荐文章于 2020-12-12 22:02:41 发布 · 243 阅读

0 ·

CC 4.0 BY-SA版权

刷题记录同时被 2 个专栏收录

37 篇文章

订阅专栏

PAT甲级题解

24 篇文章

订阅专栏

本文介绍了一种在二叉搜索树中寻找两节点最低公共祖先(LCA)的有效算法。通过分析先序遍历序列，直接定位LCA而无需实际构建树，展示了算法的高效性和数据结构理解的重要性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

这道题写完了我居然也不知道为什么这么写，完全是看了别人的操作，自己实现了一遍，但是为什么这样可行？为什么这种树的题大佬都不用建树就能做出来，我却建了树也做不出来？

这个操作其实也很简单，对某次判断，先判断这两个点到底在不在树中，不在的话就对应情况输出ERROR，如果在的话，就从给出的先序遍历序列中从前向后扫描，第一个值在这两个节点之间（包括等于）的值就是答案，再对应不同格式输出即可。

这说明，我对数据结构的理解，已经限制了我的编程能力，我还得去好好学学基础知识才行，一味多刷题，没太大作用。

#include <bits/stdc++.h>
#define N 10005
using namespace std;
set<int> si;
int a[N];
int main(){
    int n,m;
    scanf("%d%d",&m,&n);
    for (int i=0;i<n;i++) {
        scanf("%d",&a[i]);
        si.insert(a[i]);
    }
    for (int i=0;i<m;i++)   {
        int j=0,u,v;
        scanf("%d%d",&u,&v);
        if (!si.count(u)&&!si.count(v)) {printf("ERROR: %d and %d are not found.\n",u,v);continue;}
        else if (!si.count(u)||!si.count(v))    {printf("ERROR: %d is not found.\n",(!si.count(u))?u:v);continue;}
        for (;j<n;j++)
            if ((a[j]>u&&a[j]<=v)||(a[j]<=u&&a[j]>v)||(a[j]==u)||(a[j]==v))   break;
        if ((a[j]>u&&a[j]<v)||(a[j]<u&&a[j]>v)) printf("LCA of %d and %d is %d.\n",u,v,a[j]);
        else if ((a[j]==u)||(a[j]==v))  printf("%d is an ancestor of %d.\n",a[j],(a[j]==u)?v:u);
    }
    return 0;
}