# 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 sumOfLeftLeaves(self, root: Optional[TreeNode]) -> int:
if root is None:
return 0
if root.left is None and root.right is None:
return 0
leftvalue = self.sumOfLeftLeaves(root.left)
if root.left and not root.left.left and not root.left.right:
leftvalue = root.left.val
rightvalue = self.sumOfLeftLeaves(root.right)
return leftvalue + rightvalue
404. 左叶子之和
最新推荐文章于 2024-06-20 18:00:11 发布