def pathSum(root, s):
return [list(p) for p in iter_path(root) if sum(p) == s]
def hasPathSum(root, s):
return any((sum(p) == s) for p in iter_path(root))
def hasPathSum(root, s):
return any((sum(p) == s) for p in iter_path(root))
def sumNumbers(root):
return sum(digits2int_b(path) for path in iter_path(root))
def pathSum(root, s):
return [list(p) for p in iter_path(root) if sum(p) == s]
