236. 二叉树的最近公共祖先

最新推荐文章于 2025-06-13 10:25:00 发布

芒果香菠菠

最新推荐文章于 2025-06-13 10:25:00 发布

阅读量399

点赞数 7

文章标签： python 开发语言

本文链接：https://blog.youkuaiyun.com/weixin_42396719/article/details/136098720

版权

本文介绍了如何在二叉树结构中，通过Solution类的lowestCommonAncestor方法寻找两个给定节点p和q的最近公共祖先。该方法使用递归策略遍历树的左子树和右子树，直到找到两个节点或者到达叶子节点。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        if root == p or root == q or root == None:
            return root
        left = self.lowestCommonAncestor(root.left, p, q)
        right = self.lowestCommonAncestor(root.right, p, q)
        if left is not None and right is not None:
            return root
        elif left is None and right is not None:
            return right
        elif right is None and left is not None:
            return left
        else:
            return None