235_lowest-common-ancestor-of-a-binary-search-tree.py

# https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-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 p.val > root.val and q.val > root.val: return self.lowestCommonAncestor(root.right, p, q)
        elif p.val < root.val and q.val < root.val: return self.lowestCommonAncestor(root.left, p, q)
        else: return root