BST - Lowest Common Ancestor (LCA)

Number of nodes (N):

Values to insert (space separated):

Two nodes to find LCA (P Q):

BST LCA Property (O(h) time):
• If both values ≤ current node → search left
• If both values ≥ current node → search right
• Otherwise → current node is the LCA

Assumes both nodes exist in the tree (as per typical problem constraints)

Lowest Common Ancestor in BST