Package g0401_0500.s0404_sum_of_left_leaves

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    404 - Sum of Left Leaves\.

    Easy

    Given the root of a binary tree, return the sum of all left leaves.

    A leaf is a node with no children. A left leaf is a leaf that is the left child of another node.

    Example 1:

    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.

    Example 2:

    Input: root = 1

    Output: 0

    Constraints:

    • The number of nodes in the tree is in the range [1, 1000].

    • -1000 <= Node.val <= 1000

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer sumOfLeftLeaves(TreeNode root)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait