Binary Tree Paths

Given a binary tree, return all root-to-leaf paths.

For example, given the following binary tree:

   1
 /   \
2     3
 \
  5

All root-to-leaf paths are:

["1->2->5", "1->3"]

/**

 * 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:
    vector<string> binaryTreePaths(TreeNode* root) {
        vector<string> ans;
        if(root == NULL) return ans; 
        string pre;
        dfs(root,ans,pre);
        return ans;
    }
    void dfs(TreeNode* node, vector<string>& answ , string pres){
        if(node != NULL){
        if(node->left == NULL && node->right == NULL){
            pres+=to_string(node->val);
            answ.push_back(pres);
        }
        else{
            pres += to_string(node->val);
            pres += "->";
            dfs(node->left,answ,pres);
            dfs(node->right,answ,pres);
        }
        }    
    }
    
};