How do you find the lowest common ancestor in a binary tree?

class TreeNode:
    def __init__(self, val, left=None, right=None):
        self.val, self.left, self.right = val, left, right

def lowest_common_ancestor(root, p, q):
    if root is None or root is p or root is q:
        return root
    left = lowest_common_ancestor(root.left, p, q)
    right = lowest_common_ancestor(root.right, p, q)
    if left and right:
        return root            # targets split here -> LCA
    return left or right       # propagate the non-null side


# --- demo ---  tree: 3 / (5 / 4,7) , 1
n4, n7 = TreeNode(4), TreeNode(7)
root = TreeNode(3, TreeNode(5, n4, n7), TreeNode(1))
print(lowest_common_ancestor(root, n4, n7).val)   # 5