1302. 层数最深叶子节点的和

1302. 层数最深叶子节点的和

题目描述

代码实现

# 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: TreeNode) -> int:
        # 层次遍历。巧妙之处在于不用获取树的高度
        if not root:
            return

        node_sum = 0
        queue = [root]
        while queue:
            node_sum = 0
            size = len(queue)
            for _ in range(size):
                node = queue.pop(0)
                node_sum += node.val
                if node.left:
                    queue.append(node.left)
                if node.right:
                    queue.append(node.right)
        
        return node_sum

参考

官方题解