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

class Solution:
    def lowestCommonAncestor(self, root: ‘TreeNode‘, p: ‘TreeNode‘, q: ‘TreeNode‘) -> ‘TreeNode‘:
        if p.val>q.val:
            p,q=q,p
        if q.val<root.val:
            return self.lowestCommonAncestor(root.left,p,q)
        elif p.val>root.val:
            return self.lowestCommonAncestor(root.right,p,q)
        else:
            return root