LeetCode 筆記 - 1302. Deepest Leaves Sum

# 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:
        if not root:
            return root
        
        upper_quque = [root]
        lower_quque = []
        
        result = 0
        while upper_quque:           
            for node in upper_quque:
                if node.left:
                    lower_quque.append(node.left)
                if node.right:
                    lower_quque.append(node.right)
            if not lower_quque:
                for node in upper_quque:
                    result += node.val
                break
            upper_quque = lower_quque
            lower_quque = []
        
        return result