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

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

answer:

class Solution {
public:
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        vector<vector<int>> result;
        vector<int> temp;
        myPath2(root,sum,result,temp);
        return result;
    }
    
    void myPath2(TreeNode * root,int sum, vector<vector<int>> & result,vector<int> & temp){
        if(!root){
            return;
        }
        if(sum - root->val == 0 && !root->left && !root->right){
            temp.push_back(root->val);
            result.push_back(temp);
            temp.pop_back();
            return;
        }
        temp.push_back(root->val);
        myPath2(root->left,sum - root->val,result,temp);
        myPath2(root->right,sum - root->val,result,temp);
        temp.pop_back();

    }
};