Question

How do you find the lowest common ancestor (LCA) of two nodes in a binary tree?

Answer 1

Here is the code.

def find_lca(root, node1, node2):
    if not root:
        return None

    if root.value > node1 and root.value > node2:
        return find_lca(root.left, node1, node2)
    elif root.value < node1 and root.value < node2:
        return find_lca(root.right, node1, node2)
    else:
        return root.value