-
Notifications
You must be signed in to change notification settings - Fork 11
/
Day-110.cpp
35 lines (34 loc) · 908 Bytes
/
Day-110.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
/**
* 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 {
vector<string>res;
void dfs(TreeNode* root , string path){
if(root==nullptr){
return;
}
if(path.size()>0){
path+="->";
}
path+=to_string(root->val);
if(root->left == nullptr && root->right == nullptr){
res.emplace_back(path);
return;
}
dfs(root->left , path);
dfs(root->right , path);
}
public:
vector<string> binaryTreePaths(TreeNode* root) {
dfs(root , "");
return res;
}
};