题解 | #二叉搜索树的最近公共祖先#

Python 简单递归

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param root TreeNode类 
# @param p int整型 
# @param q int整型 
# @return int整型
#
class Solution:
    def lowestCommonAncestor(self , root: TreeNode, p: int, q: int) -> int:
        # write code here
        if root.val == p or root.val == q:
            return root.val
        elif p < root.val < q or q < root.val < p:
            return root.val
        elif min(p, q) > root.val:
            return self.lowestCommonAncestor(root.right, p, q)
        elif min(p, q) < root.val:
            return self.lowestCommonAncestor(root.left, p, q)