/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
void traver(TreeNode *t,vector<int>&a,vector<string>&ans){
a.push_back(t->val);
if(t->left==NULL&&t->right==NULL){
string str;
for(int i=0;i<a.size()-1;i++){
str+=to_string(a[i]);
str+="->";
}
str+=to_string(a[a.size()-1]);
ans.push_back(str);
return ;
}
if(t->left){
traver(t->left,a,ans);
a.pop_back();
}
if(t->right){
traver(t->right,a,ans);
a.pop_back();
}
}
vector<string> binaryTreePaths(TreeNode* root) {
vector<int>a;
vector<string>ans;
if(root==NULL)return ans;
traver(root,a,ans);
return ans;
}
};