113. 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.

Note: A leaf is a node with no children.

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]
]

#include <iostream>
#include <vector>

using namespace std;

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
};

void doPathSum(TreeNode* root, vector<vector<int>>& ans, vector<int>& temp, int sum){
    if(!root)   return;
    if(!root->left && !root->right){
        //leaf
        if(root->val == sum){
            temp.push_back(root->val);
            ans.push_back(temp);
            temp.pop_back();
        }
        return;
    }
    temp.push_back(root->val);
    doPathSum(root->left, ans, temp, sum - root->val);
    doPathSum(root->right, ans, temp, sum - root->val);
    temp.pop_back();
}

vector<vector<int>> pathSum(TreeNode* root, int sum) {
    if(!root)   return {};
    vector<vector<int>> ans;
    vector<int> temp;
    doPathSum(root, ans, temp, sum);
    return ans;
}