https://leetcode.com/problems/sum-of-left-leaves
Given the root of a binary tree, return the sum of all left leaves.
root
Example 1:
Example 2:
Constraints:
The number of nodes in the tree is in the range [1, 1000].
[1, 1000]
-1000 <= Node.val <= 1000
Last updated 4 years ago
**Input:** root = [3,9,20,null,null,15,7] **Output:** 24 **Explanation:** There are two left leaves in the binary tree, with values 9 and 15 respectively.
**Input:** root = [1] **Output:** 0