-
Notifications
You must be signed in to change notification settings - Fork 0
/
binary_tree_paths.cpp
50 lines (43 loc) · 1.17 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
41
42
43
44
45
46
47
48
49
50
//4ms, fast enough
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<string> binaryTreePaths(TreeNode* root) {
vector<string> ret;
if(nullptr == root) return ret;
string cur = to_string(root->val);
if(nullptr == root->left && nullptr == root->right){
ret.push_back(cur);
return ret;
}
if(root->left != nullptr) {
BTP(root->left, ret, cur);
}
if(root->right != nullptr){
BTP(root->right, ret, cur);
}
return ret;
}
private:
void BTP(TreeNode* root, vector<string> &ret, string cur){
cur += "->" + to_string(root->val);
if(nullptr == root->left && nullptr == root->right){
ret.push_back(cur);
return;
}
if(root->left != nullptr) {
BTP(root->left, ret, cur);
}
if(root->right != nullptr){
BTP(root->right, ret, cur);
}
}
};