# [Leet Code] Deepest Leaves Sum

`Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8]Output: 15`
`# Definition for a binary tree node.# class TreeNode(object):#     def __init__(self, val=0, left=None, right=None):#         self.val = val#         self.left = left#         self.right = rightclass Solution(object):    def deepestLeavesSum(self, root):        """        :type root: TreeNode        :rtype: int        """        if root:            elements = [[root.val]]            stack = [root]            self.helper(stack, elements)            total = 0            for i in elements[len(elements)-1]:                total += i             return total        else:            return 0                    def helper(self, stack, elements):        while len(stack) > 0:            values = []            length = len(stack)            for i in range(length):                node = stack.pop(0)                if node.left:                    stack.append(node.left)                    values.append(node.left.val)                if node.right:                    stack.append(node.right)                    values.append(node.right.val)            if values != []:                elements.append(values)`

--

--

## More from Matthew Boyd

Learning, and posting my findings!

Love podcasts or audiobooks? Learn on the go with our new app.