Skip to content

Commit f37d9d0

Browse files
authored
Merge pull request #3603 from aadil42/patch-120
Create 0606-construct-string-from-binary-tree.js
2 parents 5fda17b + 8369e9b commit f37d9d0

File tree

1 file changed

+35
-0
lines changed

1 file changed

+35
-0
lines changed
Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
/**
2+
* InOrder Traversal
3+
* Time O(n) | Space O(n)
4+
* https://leetcode.com/problems/construct-string-from-binary-tree/
5+
* Definition for a binary tree node.
6+
* function TreeNode(val, left, right) {
7+
* this.val = (val===undefined ? 0 : val)
8+
* this.left = (left===undefined ? null : left)
9+
* this.right = (right===undefined ? null : right)
10+
* }
11+
*/
12+
/**
13+
* @param {TreeNode} root
14+
* @return {string}
15+
*/
16+
var tree2str = function(root) {
17+
return dfs(root, []).join("");
18+
};
19+
20+
const dfs = (node, strArr) => {
21+
if (!node) return;
22+
23+
strArr.push(node.val);
24+
25+
if (node.right || node.left) strArr.push("(");
26+
dfs(node.left, strArr);
27+
if (node.right || node.left) strArr.push(")");
28+
29+
// right tree
30+
if (node.right) strArr.push("(");
31+
dfs(node.right, strArr);
32+
if (node.right) strArr.push(")");
33+
34+
return strArr;
35+
}

0 commit comments

Comments
 (0)