✨ [226]

Author: enkr1

226/my_solution.js

@@ -0,0 +1,70 @@
+class TreeNode {
+  constructor(val, left, right) {
+    this.val = (val === undefined ? 0 : val)
+    this.left = (left === undefined ? null : left)
+    this.right = (right === undefined ? null : right)
+  }
+}
+/**
+ * @param {TreeNode} root
+ * @return {TreeNode}
+ */
+function invertTree(root) {
+  if (null === root) return null;
+  if (null === root.val) return new TreeNode();
+
+  const invertNode = (node) => {
+    if (null === node) return node;
+    let left = node.left, right = node.right;
+
+    if (null !== node.left) {
+      node.right = left;
+      // node.left = right;
+      invertNode(node.right);
+    }
+
+    if (null !== node.right) {
+      node.left = right;
+      node.right = left;
+      invertNode(node.left);
+    }
+
+
+    return node;
+  }
+
+  //   while (queue.length > 0) {
+  //     let curr = queue.shift(), left = curr.left, right = curr.right;
+  //
+  //     if (null !== left) {
+  //       queue.push(left);
+  //       dummy.right = left;
+  //     }
+  //
+  //     if (null !== right) {
+  //       queue.push(right);
+  //       dummy.left = right;
+  //     }
+  //
+  //     dummy = dummy;
+  //   }
+
+  return invertNode(root);
+}
+
+//[4,2,7,1,3,6,9]
+let x =
+  // invertTree(new TreeNode(4,
+  //   new TreeNode(2, new TreeNode(1), new TreeNode(3)),
+  //   new TreeNode(7, new TreeNode(6), new TreeNode(9))
+  // ));
+  // invertTree(new TreeNode(1,
+  //   new TreeNode(2)
+  // ));
+  invertTree(new TreeNode(1,
+    null,
+    new TreeNode(2)
+  ));
+
+console.log("Result")
+console.log(x)

226/solution.js

@@ -0,0 +1,36 @@
+class TreeNode {
+  constructor(val, left, right) {
+    this.val = (val === undefined ? 0 : val)
+    this.left = (left === undefined ? null : left)
+    this.right = (right === undefined ? null : right)
+  }
+}
+/**
+ * @param {TreeNode} root
+ * @return {TreeNode}
+ */
+function invertTree(root) {
+  if (null === root) return null;
+  if (null === root.val) return new TreeNode();
+
+  const invertNode = (node) => {
+    if (null === node) return node;
+    let left = node.left, right = node.right;
+
+    if (null !== node.left) {
+      node.right = left;
+      // node.left = right;
+      invertNode(node.right);
+    }
+
+    if (null !== node.right) {
+      node.left = right;
+      node.right = left;
+      invertNode(node.left);
+    }
+
+    return node;
+  }
+
+  return invertNode(root);
+}

README.md

@@ -55,6 +55,7 @@
 - [207. Course Schedule](./207/)
 - [213. House Robber II](./213/)
 - [217. Contains Duplicate](./217/)
+- [226. Invert Binary Tree](./226/)
 - [238. Product of Array Except Self](./238/)
 - [242. Valid Anagram](./242/)
 - [268. Missing Number](./268/)
@@ -139,7 +140,7 @@ Batch create:
 NOTE: JS IS HERE
 -->
 ```ssh
-chapter=100 && mkdir ./$chapter && touch ./$chapter/my_solution.js && touch ./$chapter/solution.js && alias x="node ./$chapter/my_solution.js"
+chapter=226 && mkdir ./$chapter && touch ./$chapter/my_solution.js && touch ./$chapter/solution.js && alias x="node ./$chapter/my_solution.js"
 ```
 > then you can use `x` for quick debug.