solved question 226

Author: dmaynard24

.DS_Store

@@ -0,0 +1,33 @@
+// Invert Binary Tree
+
+// Problem 226
+// Given the root of a binary tree, invert the tree, and return its root.
+
+// Example 1:
+// Input: root = [4,2,7,1,3,6,9]
+// Output: [4,7,2,9,6,3,1]
+
+// Example 2:
+// Input: root = [2,1,3]
+// Output: [2,3,1]
+
+// Example 3:
+// Input: root = []
+// Output: []
+
+/**
+ * @param {TreeNode} root
+ * @return {TreeNode}
+ */
+const invertTree = function(root) {
+  if (root) {
+    [root.left, root.right] = [root.right, root.left];
+    if (root.left) {
+      invertTree(root.left);
+    }
+    if (root.right) {
+      invertTree(root.right);
+    }
+  }
+  return root;
+};

javascript/questions-200-300/question-226/question-226.js

@@ -0,0 +1,8 @@
+/**
+ * Definition for a binary tree node.
+ */
+function TreeNode(val, left, right) {
+  this.val = val === undefined ? 0 : val;
+  this.left = left === undefined ? null : left;
+  this.right = right === undefined ? null : right;
+}