236. Lowest Common Ancestor of a Binary Tree

最新推荐文章于 2022-07-26 15:28:15 发布

eric--lin

最新推荐文章于 2022-07-26 15:28:15 发布

阅读量142

点赞数

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

本文链接：https://blog.csdn.net/linwutao0810/article/details/52733872

版权

leetcode 专栏收录该内容

45 篇文章 0 订阅

订阅专栏

寻找最低共同父节点（LCA）

代码如下：

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){ //one in left, one in right
            return root;
        }else if (left != null && right == null){ //both in the left
            return left;
        }else if (left == null && right != null){ //both in the right
            return right;
        }else 
            return null;
    }
}