leetcode: 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.

思路

递归调用即可，注意当root为NULL的时候sum也为0的时候，返回应该是false，因为树根都不存在，那么path也不存在。

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool hasPathSum(TreeNode *root, int sum) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
		if(root == NULL) return false;
		if(root->left == NULL && root->right == NULL)
		{
			if(sum == root->val) return true;
			else return false;
		}
		else
		{
			if(root->left != NULL && hasPathSum(root->left, sum - root->val))
				return true;
			else if(root->right != NULL && hasPathSum(root->right, sum - root->val))
				return true;
			else
				return false;
		}
    }
};