← Microsoft questions

LCA of two nodes in an N-ary tree

Filed under Microsoft

Given the root of an N-ary tree and two unique nodes, find their Lowest Common Ancestor (LCA). The LCA is defined as the lowest node in the tree that has both nodes as descendants.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.