Lowest Common Ancestor of a BST

def lowestCommonAncestor(root, p, q):
    curr = root
    
    while curr:
        if p.val > curr.val and q.val > curr.val:
            curr = curr.right
        elif p.val < curr.val and q.val < curr.val:
            curr = curr.left
        else:
            return curr