Search
⌘K
Leetcode 865. Smallest Subtree with all the Deepest Nodes
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.