Lowest Common Ancestor in Binary Tree in DSA Javascript - Execution Trace

Concept Flow - Lowest Common Ancestor in Binary Tree

Start at root node

↓

Check if root is null or matches p or q

Yes↓

Return root

No↓

Recurse left subtree

↓

Recurse right subtree

↓

If left and right both non-null

↓

Return root as LCA

↓

Return non-null child (left or right)

Start from root, check if it matches either target node or is null. Recurse left and right. If both sides return nodes, current root is LCA. Otherwise, return the non-null side.

Execution Sample

DSA Javascript

function lowestCommonAncestor(root, p, q) {
  if (!root || root === p || root === q) return root;
  const left = lowestCommonAncestor(root.left, p, q);
  const right = lowestCommonAncestor(root.right, p, q);
  if (left && right) return root;
  return left || right;
}

Finds the lowest common ancestor of nodes p and q in a binary tree by recursive search.

Execution Table

Step	Operation	Node Visited	Left Result	Right Result	Return Value	Visual State
1	Start at root	3				3
2	Check root == p or q or null	3			No	3
3	Recurse left subtree	5				3 -> 5
4	Check root == p or q or null	5			No	3 -> 5
5	Recurse left subtree	6				3 -> 5 -> 6
6	Check root == p or q or null	6			Yes (node == p)	3 -> 5 -> 6
7	Return node 6	6			6	3 -> 5 -> 6
8	Recurse right subtree	2				3 -> 5 -> 6, 2
9	Check root == p or q or null	2			No	3 -> 5 -> 6, 2
10	Recurse left subtree	7				3 -> 5 -> 6, 2 -> 7
11	Check root == p or q or null	7			Yes (node == q)	3 -> 5 -> 6, 2 -> 7
12	Return node 7	7			7	3 -> 5 -> 6, 2 -> 7
13	Recurse right subtree	4				3 -> 5 -> 6, 2 -> 7, 4
14	Check root == p or q or null	4			No	3 -> 5 -> 6, 2 -> 7, 4
15	Recurse left subtree	null				3 -> 5 -> 6, 2 -> 7, 4
16	Return null	null			null	3 -> 5 -> 6, 2 -> 7, 4
17	Recurse right subtree	null				3 -> 5 -> 6, 2 -> 7, 4
18	Return null	null			null	3 -> 5 -> 6, 2 -> 7, 4
19	Left and right null, return null	4	null	null	null	3 -> 5 -> 6, 2 -> 7, 4
20	Left result 7, right null, return 7	2	7	null	7	3 -> 5 -> 6, 2 -> 7
21	Left result 6, right result 7, both non-null, return root 3	3	6	7	3	3 -> 5 -> 6, 2 -> 7

💡 Returned root 3 as lowest common ancestor because both left and right subtrees contain p and q.

Variable Tracker

Variable	Start	After Step 6	After Step 12	After Step 20	Final
root	3	6	7	2	3
left	undefined	6	6	6	6
right	undefined	undefined	7	7	7
Return Value	undefined	6	7	7	3

Key Moments - 3 Insights

Why do we return root immediately if root matches p or q?

Because if root is p or q, it could be the ancestor or one of the nodes itself. See step 6 and 11 in execution_table where root matches p or q and returns immediately.

Why do we return root when both left and right recursive calls are non-null?

Because it means p and q are found in different subtrees, so current root is their lowest common ancestor. See step 21 where both left (6) and right (7) are non-null, so root 3 is returned.

What happens if one subtree returns null?

We return the non-null subtree result because both nodes are in that subtree or one node is ancestor of the other. See step 20 where left is 7 and right is null, so 7 is returned.

Visual Quiz - 3 Questions

Look at the execution_table at step 6, what is the return value and why?

A Return null because node 6 is not p or q

B Return node 6 because it matches p

C Return root 3 because it is the ancestor

D Return node 5 because it is the parent

💡 Hint

Check the 'Return Value' column at step 6 and the 'Operation' column for matching p or q.

At which step does the function decide that node 3 is the lowest common ancestor?

A Step 12

B Step 20

C Step 21

D Step 6

💡 Hint

Look for the step where both left and right results are non-null and root is returned.

If node q was not in the tree, how would the return value at step 21 change?

A Return null because q is missing

B Return node 6 because only p is found

C Return node 7 because q is missing

D Return root 3 anyway

💡 Hint

Refer to the logic in step 20 where one subtree returns a node and the other returns null.

Concept Snapshot

Lowest Common Ancestor (LCA) in Binary Tree:
- If root is null or matches p or q, return root.
- Recursively find LCA in left and right subtrees.
- If both sides return non-null, root is LCA.
- Else return the non-null side.
- Works by bottom-up recursion checking presence of p and q.

Full Transcript

The Lowest Common Ancestor algorithm starts at the root node. If the root is null or matches either target node p or q, it returns root immediately. Otherwise, it recursively searches the left and right subtrees for p and q. If both left and right recursive calls return non-null nodes, it means p and q are found in different subtrees, so the current root is their lowest common ancestor. If only one side returns a non-null node, that node is returned upwards. The process continues until the LCA is found or the search ends. This is shown step-by-step in the execution table where nodes 6 and 7 are found in left and right subtrees of root 3, making 3 the LCA.