LeetCode257. 二叉树的所有路径

class Solution {
public:
    void traversal(TreeNode* root, vector<int>& path, vector<string>& res)
    {   
        path.push_back(root->val);
        if (root->left == nullptr && root->right == nullptr)
        {
            string s;
            for (int i = 0; i < path.size(); i++)
            {
                string num = to_string(path[i]);
                if (i == 0)
                    s += num;
                else
                {
                    s += "->";
                    s += num;
                }
                    
            }
            res.push_back(s);
        }
        if (root->left)
        {
            traversal(root->left, path, res);
            path.pop_back();
        }
        if (root->right)
        {
            traversal(root->right, path, res);
            path.pop_back();
        }
    }

    vector<string> binaryTreePaths(TreeNode* root) {

        vector<int> path;
        vector<string> res;
        traversal(root, path, res);
        return res;
    }
};