Package g1301_1400.s1302_deepest_leaves_sum

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1302 - Deepest Leaves Sum.

    Medium

    Given the root of a binary tree, return the sum of values of its deepest leaves.

    Example 1:

    Input: root = 1,2,3,4,5,null,6,7,null,null,null,null,8

    Output: 15

    Example 2:

    Input: root = 6,7,8,2,7,1,3,9,null,1,4,null,null,null,5

    Output: 19

    Constraints:

    • The number of nodes in the tree is in the range <code>1, 10<sup>4</sup></code>.

    • 1 &lt;= Node.val &lt;= 100

    • 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 deepestLeavesSum(TreeNode root)

      • Methods inherited from class java.lang.Object

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