Leetcode——235. Lowest Common Ancestor of a Binary Search Tree

本文链接：https://blog.csdn.net/xiaojie_570/article/details/80480699

题目原址

https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/description/

题目描述

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).”
Given binary search tree: root = [6,2,8,0,4,7,9,null,null,3,5]

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

Example 1:

Input: root, p = 2, q = 8
Output: 6
Explanation: The LCA of nodes 2 and 8 is 6.

Example 2:

Input: root, 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.

解题思路

给定一个二叉树BST，和两个节点，找到两个节点在二叉树中的最近的父节点的值

思路：就是递归。找到递归的出口。因为给定的两个值是一个大一个小，所以出口就是，

如果当前节点比小的节点大比大的节点小，就说明当前节点是两个节点的父节点，
否则，如果当前节点比小的节点小，则递归调用其左子树，否则递归调用其右子树

AC代码

class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root == null)
                return null;
        if((root.val - p.val) * (root.val - q.val) <= 0)
                return root;
        else {
                return p.val > root.val ? lowestCommonAncestor(root.right, p, q) : lowestCommonAncestor(root.left, p, q);
        }
    }
}