path-sum-ii

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.

For example:
Given the below binary tree andsum = 22,

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

return

[
   [5,4,11,2],
   [5,8,4,5]

]

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int> > pathSum(TreeNode *root, int sum) {
        if(root==NULL)
            return mResult;
        vector<int> Path;
        __getPathSum(root, sum, Path);
        return mResult;
        
    }
private:
    vector<vector<int>> mResult;
    void __getPathSum(TreeNode *vpRoot, int vSum, vector<int> vPath){
    if(vpRoot->left==NULL && vpRoot->right==NULL){
        int Sum=0;
        vPath.push_back(vpRoot->val);
        for(int i=0; i<vPath.size(); i++){
            Sum+=vPath[i];

            }
        if(Sum==vSum){
            mResult.push_back(vPath);
            return;
        }
    }
    vPath.push_back(vpRoot->val);
    if(vpRoot->left!=NULL)
        __getPathSum( vpRoot->left, vSum, vPath);
    if(vpRoot->right!=NULL)
        __getPathSum( vpRoot->right, vSum, vPath);
}
};