Package g1301_1400.s1302_deepest_leaves_sum

Class Solution

java.lang.Object

g1301_1400.s1302_deepest_leaves_sum.Solution

public class Solution
extends Object

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 [1, 104]. * `1 <= Node.val <= 100`

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	deepestLeavesSum(TreeNode root)

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

deepestLeavesSum

public int deepestLeavesSum(TreeNode root)