FunctionRacerProblemsRace

Sum of Left Leaves

EasyTreesPython, JavaScript, TypeScript, Java, C++

You are given the root of a binary tree. Return the sum of the values of all left leaves: leaves that are the left child of their parent. A lone root is not a left leaf. 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 [3,9,20,null,null,15,7]
returns 24

9 and 15 are left leaves: 24.

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