Leetcode 1123. Lowest Common Ancestor of Deepest Leaves
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.