How should I practice Lowest Common Ancestor of a Binary Tree?

Start by reading the full statement, solve the visible examples, then compare the pattern against related AMD phone screen problems in FastPrep.

Is Lowest Common Ancestor of a Binary Tree associated with AMD?

FastPrep tags this as a AMD phone screen coding practice problem when the problem catalog has that company and stage context.

Lowest Common Ancestor of a Binary Tree

AMD● MediumFULLTIMEPHONE SCREEN

Learn

Problem statement

All node values are unique, and both target values occur in the tree. Return the value of the lowest node whose subtree contains both p and q. A node may be an ancestor of itself.

Function

lowestCommonAncestorValue(root: TreeNode, p: int, q: int) → int

Examples

Example 1

root = [3,5,1,6,2,0,8,null,null,7,4]p = 5q = 1return = 3

The targets lie in different subtrees of node 3.

Constraints

The tree contains between 2 and 10000 nodes.
All node values are unique signed 32-bit integers.

Source note: Author-written prompt excerpt retained for source fidelity.