235. 二叉搜索树的最近公共祖先

最新推荐文章于 2024-06-17 17:35:06 发布

芒果香菠菠

最新推荐文章于 2024-06-17 17:35:06 发布

阅读量378

点赞数 4

文章标签： python 开发语言

本文链接：https://blog.csdn.net/weixin_42396719/article/details/136104625

版权

# 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.val > p.val and root.val > q.val:
            return self.lowestCommonAncestor(root.left, p, q)
        elif root.val < p.val and root.val < q.val:
            return self.lowestCommonAncestor(root.right, p, q)
        else:
            return root