feat: add js solution to lc problem: No.1110

Author: rain84

solution/1100-1199/1110.Delete Nodes And Return Forest/README.md

@@ -414,6 +414,64 @@ export function delNodes(root: T, to_delete: number[]): Array<T> {
 type T = TreeNode | null;
 ```
 
+#### JavaScript
+
+```js
+/**
+ * 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
+ * @param {number[]} to_delete
+ * @return {TreeNode[]}
+ */
+var delNodes = function (root, to_delete) {
+    if (!root) return [];
+
+    const del = new Set(to_delete);
+    const res = [];
+    let q = [root];
+
+    while (q.length) {
+        const qNext = [];
+
+        for (const node of q) {
+            if (node.left) {
+                qNext.push(node.left);
+
+                if (del.has(node.left.val)) {
+                    node.left = null;
+                }
+            }
+
+            if (node.right) {
+                qNext.push(node.right);
+
+                if (del.has(node.right.val)) {
+                    node.right = null;
+                }
+            }
+
+            if (del.has(node.val)) {
+                if (node.left) res.push(node.left);
+                if (node.right) res.push(node.right);
+            }
+        }
+
+        q = qNext;
+    }
+
+    if (!del.has(root.val)) res.push(root);
+
+    return res;
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1100-1199/1110.Delete Nodes And Return Forest/README_EN.md

@@ -410,6 +410,64 @@ export function delNodes(root: T, to_delete: number[]): Array<T> {
 type T = TreeNode | null;
 ```
 
+#### JavaScript
+
+```js
+/**
+ * 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
+ * @param {number[]} to_delete
+ * @return {TreeNode[]}
+ */
+var delNodes = function (root, to_delete) {
+    if (!root) return [];
+
+    const del = new Set(to_delete);
+    const res = [];
+    let q = [root];
+
+    while (q.length) {
+        const qNext = [];
+
+        for (const node of q) {
+            if (node.left) {
+                qNext.push(node.left);
+
+                if (del.has(node.left.val)) {
+                    node.left = null;
+                }
+            }
+
+            if (node.right) {
+                qNext.push(node.right);
+
+                if (del.has(node.right.val)) {
+                    node.right = null;
+                }
+            }
+
+            if (del.has(node.val)) {
+                if (node.left) res.push(node.left);
+                if (node.right) res.push(node.right);
+            }
+        }
+
+        q = qNext;
+    }
+
+    if (!del.has(root.val)) res.push(root);
+
+    return res;
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1100-1199/1110.Delete Nodes And Return Forest/Solution2.js

@@ -0,0 +1,53 @@
+/**
+ * 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
+ * @param {number[]} to_delete
+ * @return {TreeNode[]}
+ */
+var delNodes = function (root, to_delete) {
+    if (!root) return [];
+
+    const del = new Set(to_delete);
+    const res = [];
+    let q = [root];
+
+    while (q.length) {
+        const qNext = [];
+
+        for (const node of q) {
+            if (node.left) {
+                qNext.push(node.left);
+
+                if (del.has(node.left.val)) {
+                    node.left = null;
+                }
+            }
+
+            if (node.right) {
+                qNext.push(node.right);
+
+                if (del.has(node.right.val)) {
+                    node.right = null;
+                }
+            }
+
+            if (del.has(node.val)) {
+                if (node.left) res.push(node.left);
+                if (node.right) res.push(node.right);
+            }
+        }
+
+        q = qNext;
+    }
+
+    if (!del.has(root.val)) res.push(root);
+
+    return res;
+};