Lowest Common Ancestor of a Binary Search Tree

main.py

class Solution:
    def lowestCommonAncestor(self, node, p, q):
        if not node:
            return None
        if p.val < node.val < q.val or p.val > node.val > q.val or node.val in (p.val, q.val):
            return node
        if p.val < node.val and q.val < node.val:
            # Both nodes are on current node's left.
            return self.lowestCommonAncestor(node.left, p, q)
        # Otherwise both nodes are on current node's right.
        return self.lowestCommonAncestor(node.right, p, q)