-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathconstruct-string-from-binary-tree.cpp
More file actions
53 lines (52 loc) · 1.34 KB
/
construct-string-from-binary-tree.cpp
File metadata and controls
53 lines (52 loc) · 1.34 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
/* Problem url: https://leetcode.com/problems/construct-string-from-binary-tree
* Code by: ldcduc
* */
/**
* 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:
string result;
Solution() {
result = "";
}
void visit(TreeNode* node) {
if (node) {
result += to_string(node->val);
if (node->left) {
result += '(';
visit(node->left);
result += ')';
if (node->right) {
result += '(';
visit(node->right);
result += ')';
}
} else {
if (node->right) {
result += "()";
result += '(';
visit(node->right);
result += ')';
}
}
}
}
string tree2str(TreeNode* t) {
visit(t);
return result;
}
};
/*
* Comment by ldcduc
* Suggested tags: binary search tree, string, implementation
*
* */