LeetCode｜1302. Deepest Leaves Sum-CSDN博客

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/139513441

.

题目

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

.

思路

这道题既可以用DFS也可以用BFS来解。
出于想练习BFS，这题我用了广度优先的思路来做。

BFS的思路设计：

首先将二叉树的根节点root存入队列中。
保存每一层的子节点到队列queue中。
每一层遍历结束后，判断是否还有下一层节点，如果没有，则返回求和值。
如果还有下一层，则开始迭代下一层节点。

.

代码

# 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 deepestLeavesSum(self, root: Optional[TreeNode]) -> int:
        from collections import deque

        cur_queue = deque([root])
        next_queue = deque()
        
        sum = 0
        while cur_queue:
            node = cur_queue.popleft()
            sum = sum + node.val
            
            if node.left:
                next_queue.append(node.left)
            if node.right:
                next_queue.append(node.right)

            if len(cur_queue) == 0:
                if len(next_queue) == 0:
                    break
                sum = 0
                cur_queue = next_queue.copy()
                next_queue.clear()

        return sum