递归-68.1 同-235. 二叉搜索树的最近公共祖先

最新推荐文章于 2023-08-14 17:34:53 发布

fxy流年无悔

最新推荐文章于 2023-08-14 17:34:53 发布

阅读量127

点赞数

分类专栏：二叉搜索树递归文章标签：递归二叉搜索树

本文链接：https://blog.csdn.net/a716121/article/details/105770451

版权

递归同时被 2 个专栏收录

15 篇文章 0 订阅

订阅专栏

二叉搜索树

2 篇文章 0 订阅

订阅专栏

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

法二：同递归-68.2 普通二叉树-同-236. 二叉树的最近公共祖先代码，线索二叉树是二叉树的特例化

/**
 * 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) {
        if(root==null||root==p||root==q) return root;
        TreeNode left=lowestCommonAncestor(root.left,p,q);
        TreeNode right=lowestCommonAncestor(root.right,p,q);
        if(left!=null&&right!=null) return root;
        return left==null?right:left;     
    }
}