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

Have you met this question in a real interview?

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    /*algorithm: preorder travel
        sum can be negative, so dont use < 0 to do cut.
    */
    void preorder(TreeNode* root,vector<vector<int> >&result,vector<int>&path,int sum)
    {
        if(!root)return;
        if(sum==root->val && !root->left && !root->right){ //find one path
            path.push_back(root->val);
            result.push_back(path);
            path.pop_back();
            return;
        }
        TreeNode* trees[]={root->left,root->right};
        for(int i = 0;i < 2;i++){
            path.push_back(root->val);
            preorder(trees[i],result,path,sum-root->val);
            path.pop_back();
        }
    }
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
            vector<vector<int>>result;
            vector<int>path;
            preorder(root,result,path,sum);
            return result;
    }
};