【Leetcode】Lowest Common Ancestor of a Binary Search Tree

最新推荐文章于 2022-02-12 22:47:33 发布

qbt4juik

最新推荐文章于 2022-02-12 22:47:33 发布

阅读量305

点赞数

分类专栏： Leetcode 文章标签： Leetcode Java

本文链接：https://blog.csdn.net/qbt4juik/article/details/50604779

版权

Leetcode 专栏收录该内容

112 篇文章 0 订阅

订阅专栏

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.

其实特别简单。。。这个是非常simple的……………………三种情况

1）比如说对比2和8，一个大于root，一个小于root，那么咱就return root

2）比如说3，5都比root小，recursive的call function（root。left）

3）反之，function（root。left）

so easy，妈妈再也不用担心我的学习了

/**
 * 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 (root.val == p.val || root.val == q.val) return root;
        if(root.val>p.val && root.val<q.val || root.val>q.val && root.val<p.val)
        	return root;
        else if(root.val<p.val && root.val<q.val)
        	return lowestCommonAncestor(root.right,p,q);
        else
        	return lowestCommonAncestor(root.left,p,q);
    }
}