We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 3ac0528 commit e624b6aCopy full SHA for e624b6a
1 file changed
invert-binary-tree/sunjae95.js
@@ -0,0 +1,23 @@
1
+/**
2
+ * @description
3
+ * brainstorming:
4
+ * preorder traverse
5
+ *
6
+ * n = length of root
7
+ * time complexity: O(n)
8
+ * space complexity: O(n)
9
+ */
10
+var invertTree = function (root) {
11
+ const preOrder = (tree) => {
12
+ if (tree === null) return null;
13
+
14
+ const currentNode = new TreeNode(tree.val);
15
16
+ currentNode.right = preOrder(tree.left);
17
+ currentNode.left = preOrder(tree.right);
18
19
+ return currentNode;
20
+ };
21
22
+ return preOrder(root);
23
+};
0 commit comments