FunctionRacerProblemsRace

Deepest Leaves Sum

EasyTreesPython, JavaScript, TypeScript, Java, C++

You are given the root of a binary tree. Find the deepest level of the tree (the one farthest from the root) and return the sum of all values on that level. An empty tree gives 0.

Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.

Example 1

root [1,2,3,4,5,null,6,7,null,null,null,null,8]
returns 15

The deepest level holds 7 and 8, so the sum is 15.

Constraints

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More Trees problems