leetcode: 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:
    vector<vector<int> > pathSum(TreeNode *root, int sum) {
        if( root == NULL)
            return vector<vector<int> >();
        vector< vector< int> > res;
        vector< int> tmp;
        core( root, res, tmp, sum, 0);
        return res;
    }
    void core( TreeNode *root, vector< vector< int> > &res, vector<int> &tmp, int sum, int cur){
        if( root->left == NULL && root->right == NULL){
            if( root->val + cur == sum){
                tmp.push_back(root->val);
                res.push_back(tmp);
                tmp.pop_back();//记得这里也需要弹出的
                return;
            }
            else
                return;
        }
        else if( root->left == NULL){
            tmp.push_back(root->val);
            core( root->right, res, tmp, sum, cur+root->val);
            tmp.pop_back();
        }
        else if( root->right == NULL){
            tmp.push_back(root->val);
            core( root->left, res, tmp, sum, cur+root->val);
            tmp.pop_back();
        }
        else{
            tmp.push_back(root->val);
            core( root->left, res, tmp, sum, cur+root->val);
            core( root->right, res, tmp, sum, cur+root->val);
            tmp.pop_back();
        }
    }
};