diff --git a/invert-binary-tree/limlimjo.js b/invert-binary-tree/limlimjo.js
new file mode 100644
index 000000000..450ced8c7
--- /dev/null
+++ b/invert-binary-tree/limlimjo.js
@@ -0,0 +1,22 @@
+// 시간 복잡도: O(n)
+// 공간 복잡도: O(n)
+
+/**
+ * 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)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {TreeNode}
+ */
+var invertTree = function (root) {
+  if (!root) return null;
+
+  [root.left, root.right] = [invertTree(root.right), invertTree(root.left)];
+
+  return root;
+};