LeetCode：Lowest Common Ancestor of a Binary Search Tree

最新推荐文章于 2025-08-04 20:35:07 发布

fullstack_lth

最新推荐文章于 2025-08-04 20:35:07 发布

阅读量307

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode java

本文链接：https://blog.youkuaiyun.com/u014744118/article/details/49866713

LeetCode 专栏收录该内容

161 篇文章

订阅专栏

本文介绍如何在二叉搜索树中找到两个指定节点的最低公共祖先(LCA)，通过递归方法实现，并提供Java代码示例。

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

问题描述：

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v and w as the lowest node in T that has both v and w as descendants (where we allow a node to be a descendant of itself).”

        _______6______
       /              \
    ___2__          ___8__
   /      \        /      \
   0      _4       7       9
         /  \
         3   5

For example, the lowest common ancestor (LCA) of nodes 2 and 8 is 6. Another example is LCA of nodes 2 and 4 is 2, since a node can be a descendant of itself according to the LCA definition.

思路：

递归调用思路较简单，如果两个节点都比根节点小，在左子树寻找，反之，如果两个节点都比根节点大，就在右子树找，如果都不满足，则一个在左子树，一个在右子树，返回根节点。

JAVA代码：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root == null || p == null || q == null){
            return null;
        }
        if(p == root || q == root){
            return root;
        }
        if(Math.max(p.val,q.val) < root.val){
            return lowestCommonAncestor(root.left,p,q);
        }
        else if(Math.min(p.val,q.val) > root.val){
            return lowestCommonAncestor(root.right,p,q);
         }
        else return root;
}
}