Available question text
Given a binary tree, return the root of the smallest subtree that contains all nodes at the maximum depth (i.e., the lowest common ancestor of all deepest leaves).
Related questions
Continue with questions that share topics or the same question type.
- Add Edges to Make Degrees of All Nodes Even
Coding
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Count Nodes Equal to Average of Subtree
Coding · Binary Tree · Depth-First Search · Tree
- Find All The Lonely Nodes
Coding
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 865. Smallest Subtree with all the Deepest Nodes
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source