-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinary_Tree_Paths.cpp
More file actions
84 lines (65 loc) · 1.66 KB
/
Copy pathBinary_Tree_Paths.cpp
File metadata and controls
84 lines (65 loc) · 1.66 KB
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
vector<string> result;
vector<int> element;
void binaryTreePathsHelper(TreeNode* root){
element.push_back(root->val );
if(root->left == NULL && root->right == NULL){
stringstream ss; int i;
for (i = 0; i < element.size()-1; ++i)
{
ss << element[i] << "->";
}ss<<element[i];
result.push_back(ss.str());
return;
}
if(root->left == NULL){
binaryTreePathsHelper(root->right);
element.pop_back();
}else if(root->right == NULL){
binaryTreePathsHelper(root->left);
element.pop_back();
}else {
binaryTreePathsHelper(root->left);
element.pop_back();
binaryTreePathsHelper(root->right);
element.pop_back();
}
}
vector<string> binaryTreePaths(TreeNode* root) {
result.clear(); element.clear();
if (root == NULL) return result;
binaryTreePathsHelper(root);
return result;
}
};
Solution s;
int main(int argc, char const *argv[])
{
/* code */
TreeNode root(1);
TreeNode level1_left(2);
TreeNode level1_right(3);
root.left = &level1_left;
root.right = &level1_right;
TreeNode level2_right(5);
level1_left.right = &level2_right;
vector<string> result = s.binaryTreePaths(&root);
cout<< "output size array size: " << result.size() << endl;
for (int i = 0; i < result.size(); ++i)
{
cout<< result[i] << endl;
}
return 0;
}