dfs
def sumOfLeftLeaves(self, root):
"""
:type root: TreeNode
:rtype: int
"""
self.res = 0
def pre(root):
if not root:
return None
if root.left and not root.left.left and not root.left.right:
self.res += root.left.val
pre(root.left)
pre(root.right)
pre(root)
return self.res