【leetcode 简单】 第九十四题 左叶子之和

# 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
        """
        tmp = 0
        if root:
            left, right = root.left,root.right
            if left and(left.left or left.right) is None:
                tmp+=left.val
            tmp += self.sumOfLeftLeaves(left)+self.sumOfLeftLeaves(right)
        return tmp