[Leetcode] 112. Path Sum

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

For example:
Given the below binary tree and  sum = 22 ,

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \      \
        7    2      1

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

Solution: 树的遍历

Running Time: O(n)

# 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):
        result = 0
        if root is not None:
            result += root.val
            if (root.left is None) and (root.right is None) and (result == sum):
                return True
            else:
                return self.hasPathSum(root.left, sum-root.val) or self.hasPathSum(root.right, sum-root.val)
        return False