236. Lowest Common Ancestor of a Binary Tree

最新推荐文章于 2025-06-21 21:28:29 发布

ujn20161222

最新推荐文章于 2025-06-21 21:28:29 发布

阅读量223

点赞数 3

CC 4.0 BY-SA版权

文章标签： leetcode

本文链接：https://blog.csdn.net/ujn20161222/article/details/142912395

236. Lowest Common Ancestor of a Binary Tree

# 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 in (None,p,q):
            return root
        left = self.lowestCommonAncestor(root.left, p, q)
        right = self.lowestCommonAncestor(root.right, p, q)
        if left and right:
            return root
        else:
            return left or right

Like enumerate