286. Lowest Common Ancestor of a Binary Tree

Medium•

Given a binary tree root and two node values p and q, return the value of their lowest common ancestor (LCA).

If one value does not exist in the tree, return null.

Examples

// Tree:
//         3
//       /   \
//      5     1
//     / \   / \
//    6   2 0   8
//       / \
//      7   4

lowestCommonAncestor(root, 5, 1); // 3
lowestCommonAncestor(root, 5, 4); // 5

Constraints

Node values are unique
Tree can be empty
Need to handle ancestor-descendant relationship

Accepted14/19|Acceptance Rate73.7%

Loading problem…

286. Lowest Common Ancestor of a Binary Tree

Medium•

Given a binary tree root and two node values p and q, return the value of their lowest common ancestor (LCA).

If one value does not exist in the tree, return null.

Examples

// Tree:
//         3
//       /   \
//      5     1
//     / \   / \
//    6   2 0   8
//       / \
//      7   4

lowestCommonAncestor(root, 5, 1); // 3
lowestCommonAncestor(root, 5, 4); // 5

Constraints

Node values are unique
Tree can be empty
Need to handle ancestor-descendant relationship

Accepted14/19|Acceptance Rate73.7%

286. Lowest Common Ancestor of a Binary Tree

Examples

Constraints

Unlock Progressive Hints

286. Lowest Common Ancestor of a Binary Tree

Examples

Constraints

Unlock Progressive Hints