【LeetCode】236. Lowest Common Ancestor of a Binary Tree

最新推荐文章于 2024-11-05 21:58:11 发布

水林夕smile

最新推荐文章于 2024-11-05 21:58:11 发布

阅读量199

点赞数

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

本文链接：https://blog.csdn.net/u012404928/article/details/70038223

版权

算法同时被 2 个专栏收录

12 篇文章 0 订阅

订阅专栏

Leetcode

5 篇文章 0 订阅

订阅专栏

算法描述
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

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).”

算法

public 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 ? left : right;
    }
}