【leetcode】235. Lowest Common Ancestor of a Binary Search Tree

最新推荐文章于 2022-11-16 17:34:17 发布

原创最新推荐文章于 2022-11-16 17:34:17 发布 · 91 阅读

0 ·

CC 4.0 BY-SA版权

解题报告同时被 2 个专栏收录

203 篇文章

订阅专栏

leetcode题解大全

115 篇文章

订阅专栏

本文探讨了在二叉搜索树中寻找两个指定节点的最低公共祖先（LCA）的问题，提供了详细的解决方案及代码实现。通过利用二叉搜索树的特性，即根节点值大于左子树所有节点值且小于右子树所有节点值，我们能够高效地找到目标节点的公共祖先。

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 p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”

Given binary search tree: root = [6,2,8,0,4,7,9,null,null,3,5]

Example 1:

Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8
Output: 6
Explanation: The LCA of nodes 2 and 8 is 6.

Example 2:

Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 4
Output: 2
Explanation: The LCA of nodes 2 and 4 is 2, since a node can be a descendant of itself according to the LCA definition.

Note:

All of the nodes' values will be unique.
p and q are different and both values will exist in the BST.

思考：这是一道二叉搜索树的题目，与普通的二叉树不同，我们可以利用二叉搜索树的特点来帮助解题。即根结点的值比左子树的结点值大，而比右子树结点的值小。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        int parent = root.val;
        int pVal = p.val;
        int qVal = q.val;
        if(pVal < parent && qVal < parent) {
            return lowestCommonAncestor(root.left,p,q);
        } else if(pVal > parent && qVal > parent) {
            return lowestCommonAncestor(root.right,p,q);
        } else {
            return root;
        }
    }
}