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 pathSum(vector<vector<int> > &paths, vector<int> &path, TreeNode *tree, int sum)
{
if(!tree) return;
path.push_back(tree->val);
if(!tree->left && !tree->right && tree->val==sum)
paths.push_back(path);
if(tree->left)
{
pathSum(paths,path,tree->left,sum-tree->val);
path.pop_back();
}
if(tree->right)
{
pathSum(paths,path,tree->right,sum-tree->val);
path.pop_back();
}
}
vector<vector<int> > pathSum(TreeNode *root, int sum) {
vector<vector<int> > paths;
vector<int> path;
pathSum(paths,path,root,sum);
return paths;
}
};