Path Sum II

/*

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 and sum = 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:
    void findSum(TreeNode *node, int currSum, int const sum, bool &found, vector<int> path, vector<vector<int>> &result){
       if(node==NULL) return ;
      
       currSum = currSum+node->val;
       path.push_back(node->val);
       if(sum==currSum&&node->left==NULL&&node->right==NULL){
          found = true;
          result.push_back(path);
       }
       findSum(node->left,currSum,sum,found,path,result);
       findSum(node->right,currSum,sum,found,path,result);
    }
    vector<vector<int> > pathSum(TreeNode *root, int sum) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int currSum = 0;
        bool found = false;
        vector<int> path;
        vector<vector<int>> result;
        findSum(root,currSum,sum,found,path,result);
        return result;
    }
};