leetcode_gym/_problems/deepestLeavesSumBFS.md

layout, title, last_solved, category, leetcode_url, status

layout	title	last_solved	category	leetcode_url	status
page	Deepest Leaves Sum (BFS)	2020-08-31	bfs	https://leetcode.com/problems/deepest-leaves-sum/	Solved

{% highlight python %}

def deepestLeavesSum(self, root: TreeNode) -> int:
    
    if not root: return 0
    
    queue = [root]
    levels = []
    
    while queue:

        level = [] 
        
        for _ in range(len(queue)):
        
            node = queue.pop(0)
        
            level.append(node.val)
        
            if node.left:
                queue.append(node.left)
            if node.right:
                queue.append(node.right)

        levels.append(level)
    
    return sum(levels[-1])

{% endhighlight %}