-
Notifications
You must be signed in to change notification settings - Fork 0
/
Binary Tree Paths.cpp
40 lines (39 loc) · 1.08 KB
/
Binary Tree Paths.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
35
36
37
38
39
40
/**
* 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 solve(string temp, vector<string>&ans, TreeNode* root){
if(root==NULL) return ;
if(root->left==NULL && root->right==NULL){
if(temp.length()>0){
temp+='-';
temp+='>';
}
temp+=to_string(root->val);
ans.push_back(temp);
return ;
}
if(temp.length()>0){
temp+='-';
temp+='>';
}
temp+=to_string(root->val);
solve(temp,ans,root->left);
solve(temp,ans,root->right);
}
vector<string> binaryTreePaths(TreeNode* root) {
vector<string>ans;
string temp="";
solve(temp,ans,root);
return ans;
}
};