Lowest Common Ancestor of a Binary Tree

美团

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. Assume all node values are unique, and both p and q are different and exist in the tree.

Example:

  • Inpu...

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: