First Common Ancestor with Parent Pointers

meta

Given two nodes u and v in a rooted tree, find their lowest common ancestor (LCA): the deepest node that is an ancestor of both nodes.

Each node has:

  • A pointer parent to its parent; the root...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: