LeetCode(236) Lowest Common Ancestor of a Binary Tree解题报告

最新推荐文章于 2022-10-10 12:58:14 发布

Ssunsets

最新推荐文章于 2022-10-10 12:58:14 发布

阅读量675

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/Ssunsets/article/details/50338721

版权

LeetCode 专栏收录该内容

32 篇文章 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).”

        _______3______
       /              \
    ___5__          ___1__
   /      \        /      \
   6       2       0       8
          / \
         7   4

解题思路:
LCA满足下列条件之一:
1. C = p || C == q 则C 为 LCA
2. C.left 和C.right 各包含p || q中的一个则C 为 LCA
否则递归调用左子树或右子树，直到找到LCA

public class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root == null)
            return null;
        if(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;
    }
}