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
SOLUTION:
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def inorder(self, root, l):
if root:
self.inorder(root.left, l + 1)
if not root.left and not root.right:
if l > self.deepest:
self.deepest = l
self.deepestsum = root.val
elif l == self.deepest:
self.deepestsum += root.val
self.inorder(root.right, l + 1)
def deepestLeavesSum(self, root: Optional[TreeNode]) -> int:
self.deepest = 0
self.deepestsum = 0
self.inorder(root, 0)
return self.deepestsum
Top comments (0)