【关关的刷题日记59】Leetcode 257 Binary Tree Paths

void dfs(TreeNod e* root, vecto r <strin g> &re, string
temp)
{
    temp = temp + to_string(root->val)+"->";
if (!root->left & & !root->right)
{
    temp.resize(temp.size() - 2);
re.push_back(temp);
}
if (root->left)
{
dfs(root->left, re, temp);
}
if (root->right)
{
dfs(root->right, re, temp);
}
}

vector < string > binaryTreePaths(TreeNode * root)
{
    vector < string > re;
string
temp;
if (!root)
return re;
dfs(root, re, temp);
return re;
}};