Lowest Common Ancestor with Parent Pointers

Given two binary-tree nodes p and q. Each node has a parent pointer, but the root is not provided.

Return their lowest common ancestor (LCA). Return null if the two nodes belong to different ...

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: