Practice Lowest Common Ancestor of a Binary Tree
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”
Source: Lowest Common Ancestor of a Binary Tree on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 1
3
# Example 2
root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 4
5
# Example 3
root = [1,2], p = 1, q = 2
1
Constraints
Related LeetCode Problems
Practice more problems similar to Lowest Common Ancestor of a Binary Tree.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.