@@ -0,0 +1,581 @@
+# Definition for a binary tree node.%0A# class TreeNode(object):%0A#     def __init__(self, x):%0A#         self.val = x%0A#         self.left = None%0A#         self.right = None%0A%0Aclass Solution(object):%0A    def sumOfLeftLeaves(self, root):%0A        %22%22%22%0A        :type root: TreeNode%0A        :rtype: int%0A        %22%22%22%0A        return self.dfs(root, False)%0A    %0A    def dfs(self, node, isleft):%0A        if not node:%0A            return 0%0A        if isleft and (not node.left) and (not node.right):%0A            return node.val%0A        return self.dfs(node.left, True) + self.dfs(node.right, False)%0A

Create SumofLeftLeaves_recursive.py