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]
]
Solution:
Code:
<span style="font-size:14px;">/**
* 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 helper(TreeNode *root, const int &sum, vector<vector<int> > &results, vector<int> &result, int tempSum) {
if (root->left == NULL && root->right == NULL) {
if (tempSum+root->val == sum) {
result.push_back(root->val);
results.push_back(result);
result.pop_back();
}
return;
}
result.push_back(root->val);
if (root->left != NULL)
helper(root->left, sum, results, result, tempSum+root->val);
if (root->right != NULL)
helper(root->right, sum, results, result, tempSum+root->val);
result.pop_back();
return;
}
vector<vector<int> > pathSum(TreeNode *root, int sum) {
vector<vector<int> > results;
if (root == NULL) return results;
vector<int> result;
helper(root, sum, results, result, 0);
return results;
}
};</span>