leetcode-solutions/PathSum.py at master · vvalleru/leetcode-solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
# Definition for a  binary tree node
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    # @param root, a tree node
    # @param sum, an integer
    # @return a boolean
    def hasPathSum(self, root, sum):
        if root and root.left and root.right:
            return self.hasPathSum(root.left, sum - root.val) or self.hasPathSum(root.right, sum - root.val)
        elif root and root.left:
            return self.hasPathSum(root.left, sum - root.val)
        elif root and root.right:
            return self.hasPathSum(root.right, sum - root.val)
        else:
            if root and root.val == sum:
                return True
        return False