算法-二叉树的最近公共祖先

最新推荐文章于 2024-09-13 16:27:15 发布

也想洒脱

最新推荐文章于 2024-09-13 16:27:15 发布

阅读量57

点赞数

分类专栏：算法文章标签：算法

本文链接：https://blog.csdn.net/weixin_44629054/article/details/120517376

版权

算法专栏收录该内容

21 篇文章 0 订阅

订阅专栏

题目：给定一个二叉树, 找到该树中两个指定节点的最近公共祖先。

思路：可能的情况有两种，如下图：
在这里插入图片描述
贴上代码：

public class LowestCommonAncestor {
    @Test
    public void test(){
        TreeNode head = new TreeNode(1);
        head.left = new TreeNode(2);
        head.right = new TreeNode(3);
        head.left.left = new TreeNode(4);
        head.left.right = new TreeNode(5);
        head.right.left = new TreeNode(6);
        head.right.right = new TreeNode(7);
        head.right.right.left = new TreeNode(8);

        TreeNode o1 = head.left.right;
        TreeNode o2 = head.right.left;

        TreeNode res = lowestCommonAncestor(head, o1, o2);
        System.out.println(res.val);
    }
    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 ? left : right;
    }
}