25 lines
703 B
Python
25 lines
703 B
Python
# Definition for a binary tree node.
|
|
# class TreeNode(object):
|
|
# def __init__(self, x):
|
|
# self.val = x
|
|
# self.left = None
|
|
# self.right = None
|
|
|
|
class Solution(object):
|
|
def sumOfLeftLeaves(self, root):
|
|
"""
|
|
:type root: TreeNode
|
|
:rtype: int
|
|
"""
|
|
left_leaves_sum = 0
|
|
if root:
|
|
if root.left and self.is_leaf(root.left):
|
|
left_leaves_sum += root.left.val
|
|
left_leaves_sum += self.sumOfLeftLeaves(root.right)
|
|
left_leaves_sum += self.sumOfLeftLeaves(root.left)
|
|
|
|
return left_leaves_sum
|
|
|
|
def is_leaf(self, node):
|
|
return node and not node.left and not node.right
|