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.

/**
 * 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  FindPath(TreeNode*  root,int nAdd, int nExpected)
  {
	TreeNode* pTemp=root;
    nAdd=nAdd+(pTemp->val);

	bool bRet=pTemp->left==NULL && pTemp->right==NULL && nAdd==nExpected; //左右都为空
	if(bRet)
	{
		return  true;
	}

    bool bRet1=false;
    bool bRet2=false;
	if(pTemp->left)
	{
       bRet1=FindPath(pTemp->left, nAdd,nExpected);
	}
	
	if(pTemp->right)
	{
       bRet2=FindPath(pTemp->right, nAdd,nExpected);
	}

    nAdd-=(pTemp->val);
	return  bRet1 || bRet2;
  }
  
    bool hasPathSum(TreeNode *root, int sum) {
    if(root==NULL)
	{
		return  false;
	}

	int n=0;
	return FindPath(root,0,sum);
    }
    
  
};