Sum of Left Leaves

Find the sum of all left leaves in a given binary tree.

Example:

    3
   / \
  9  20
    /  \
   15   7

There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.

# 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
        """
        """
        def sumLLeaves(root, isLeft = False):
            if root == None:
                return 0
            if root.left == None and root.right == None:
                if isLeft:
                    return root.val
                else:
                    return 0
            return sumLLeaves(root.left, True) + sumLLeaves(root.right, False)
        
        return sumLLeaves(root, isLeft = False)
        """
        def sumLLeaves(root):
            if root == None:
                return 0
            if root.left != None and root.left.left == None and root.left.right == None:
                return root.left.val + sumLLeaves(root.right)
                
            return sumLLeaves(root.left) + sumLLeaves(root.right)
            
        return sumLLeaves(root)
        

class Solution(object):
    def sumOfLeftLeaves(self, root):
        if not root: return 0
        if root.left and not root.left.left and not root.left.right:
            return root.left.val + self.sumOfLeftLeaves(root.right)
        return self.sumOfLeftLeaves(root.left) + self.sumOfLeftLeaves(root.right)   # isn't leave