赵二的刷题日记030《最小公共父节点》

最新推荐文章于 2024-10-09 22:28:58 发布

月神2019

最新推荐文章于 2024-10-09 22:28:58 发布

阅读量52

点赞数

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

本文链接：https://blog.csdn.net/qq_20013333/article/details/118784001

版权

LeetCode 专栏收录该内容

48 篇文章 0 订阅

订阅专栏

Lowest Common Ancestor of a Binary Tree

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 p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”

Example 1:

Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 1
Output: 3
Explanation: The LCA of nodes 5 and 1 is 3.

Example 2:

Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 4
Output: 5
Explanation: The LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.

Example 3:

Input: root = [1,2], p = 1, q = 2
Output: 1

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
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)
            return right;
        
        if (right == null)
            return left;
        
        if (right != null && left != null)
            return root;
        
        return null;
    }
}