LeetCode236 二叉树的最低公共祖先

最新推荐文章于 2024-08-11 11:01:57 发布

原创最新推荐文章于 2024-08-11 11:01:57 发布 · 526 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

本文探讨了在给定二叉树中寻找两个节点的最低公共祖先(LCA)的问题，详细解析了算法原理，并提供了具体示例。通过递归方式，算法能够有效地找到作为两个节点后代的最低节点。

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

Given the following binary tree: root = [3,5,1,6,2,0,8,null,null,7,4]

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.

public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root == null || root == p || root == q) return root;
        root.left = lowestCommonAncestor(root.left, p, q);
        root.right = lowestCommonAncestor(root.right, p, q);
        if(root.left != null && root.right != null) return root;
        if(root.left != null) return root.left;
        return root.right;
    }