【LeetCode】【HOT】236. 二叉树的最近公共祖先（递归）

最新推荐文章于 2025-05-09 07:00:00 发布

原创最新推荐文章于 2025-05-09 07:00:00 发布 · 128 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode

LeetCode 专栏收录该内容

122 篇文章

订阅专栏

本文介绍了一种解决二叉树最近公共祖先问题的方法。通过递归遍历二叉树，当根节点为空或者等于目标节点之一时返回该节点。若左子树未找到目标，则返回右子树查找结果；反之亦然。最终在左右子树均找到目标时返回当前根节点。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

【LeetCode】【HOT】236. 二叉树的最近公共祖先

文章目录

【LeetCode】【HOT】236. 二叉树的最近公共祖先

在这里插入图片描述

package hot;

class TreeNode{
    int val;
    TreeNode left;
    TreeNode right;

    TreeNode(int val){
        this.val = val;
    }
}

public class Solution236 {
    public static void main(String[] args) {
        TreeNode node1 = new TreeNode(3);
        TreeNode node2 = new TreeNode(5);
        TreeNode node3 = new TreeNode(1);
        TreeNode node4 = new TreeNode(6);
        TreeNode node5 = new TreeNode(2);
        TreeNode node6 = new TreeNode(0);
        TreeNode node7 = new TreeNode(8);
        TreeNode node8 = new TreeNode(7);
        TreeNode node9 = new TreeNode(4);
        node1.left = node2;
        node1.right = node3;
        node2.left = node4;
        node2.right = node5;
        node3.left = node6;
        node3.right = node7;
        node5.left = node8;
        node5.right = node9;
        Solution236 solution = new Solution236();
        System.out.println(solution.method(node1, node2, node9).val);
    }

    private TreeNode method(TreeNode root, TreeNode p, TreeNode q){
        if(root == null || root == p || root == q){
            return root;
        }
        TreeNode left = method(root.left, p, q);
        TreeNode right = method(root.right, p, q);
        if(left == null && right == null) return null;
        if(left == null) return right;
        if(right == null) return left;
        return root;
    }
}

//时间复杂度为 O(n)
//空间复杂度为 O(n)