Search
⌘K

Leetcode 1302. Deepest Leaves Sum

Return the sum of the node values at the maximum depth of a binary tree — i.e., find the deepest level and sum all leaf values there. Input size up to 10^4 nodes.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Your account is free and you can post anonymously if you choose.