From 051321077ffecdb3a0cfe1c18333c7cc46067e40 Mon Sep 17 00:00:00 2001
From: Jerry-306 <82520819+Jerry-306@users.noreply.github.com>
Date: Sun, 26 Sep 2021 10:38:56 +0800
Subject: [PATCH] =?UTF-8?q?=E6=96=B0=E5=A2=9E=200617.=E5=90=88=E5=B9=B6?=
 =?UTF-8?q?=E4=BA=8C=E5=8F=89=E6=A0=91=20=20=20JavaScript=20=E8=BF=AD?=
 =?UTF-8?q?=E4=BB=A3=E6=B3=95=E4=BB=A3=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0617.合并二叉树.md | 49 ++++++++++++++++++++++++++++++++
 1 file changed, 49 insertions(+)

diff --git a/problems/0617.合并二叉树.md b/problems/0617.合并二叉树.md
index e21efcb3..80200c03 100644
--- a/problems/0617.合并二叉树.md
+++ b/problems/0617.合并二叉树.md
@@ -507,6 +507,8 @@ func mergeTrees(root1 *TreeNode, root2 *TreeNode) *TreeNode {
 
 ## JavaScript 
 
+> 递归法：
+
 ```javascript
 /**
  * Definition for a binary tree node.
@@ -535,6 +537,53 @@ var mergeTrees = function (root1, root2) {
     return preOrder(root1, root2);
 };
 ```
+> 迭代法：
+
+```javascript
+
+/**
+ * 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} root1
+ * @param {TreeNode} root2
+ * @return {TreeNode}
+ */
+var mergeTrees = function(root1, root2) {
+    if (root1 === null) return root2;
+    if (root2 === null) return root1;
+
+    let queue = [];
+    queue.push(root1);
+    queue.push(root2);
+    while (queue.length) {
+        let node1 = queue.shift();
+        let node2 = queue.shift();;
+        node1.val += node2.val;
+        if (node1.left !== null && node2.left !== null) {
+            queue.push(node1.left);
+            queue.push(node2.left);
+        }
+        if (node1.right !== null && node2.right !== null) {
+            queue.push(node1.right);
+            queue.push(node2.right);
+        }
+        if (node1.left === null && node2.left !== null) {
+            node1.left = node2.left;
+        }
+        if (node1.right === null && node2.right !== null) {
+            node1.right = node2.right;
+        } 
+    }
+    return root1;
+};
+
+```
 
 
 -----------------------