Available question text
Find the node that is the lowest common ancestor of all leaves at the maximum depth in a binary tree — equivalently, the root of the smallest subtree that contains every deepest leaf.
Related questions
Continue with questions that share topics or the same question type.
- Lowest Common Ancestor of a Binary Search Tree
Coding
- Lowest Common Ancestor of a Binary Tree
Coding · Binary Lifting · Binary Tree · Depth-First Search
- Lowest Common Ancestor of a Binary Tree II
Coding
- Lowest Common Ancestor of a Binary Tree III
Coding · Binary Lifting · Binary Tree · Hash Table
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1123. Lowest Common Ancestor of Deepest Leaves
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source