From fa601e179aab6b17b31a9a88d2af0cf62fe1464e Mon Sep 17 00:00:00 2001
From: kok-s0s <2694308562@qq.com>
Date: Mon, 21 Jun 2021 15:46:42 +0800
Subject: [PATCH] =?UTF-8?q?JavaScript=E7=89=88=E6=9C=AC=E7=9A=84=E5=90=88?=
 =?UTF-8?q?=E5=B9=B6=E4=BA=8C=E5=8F=89=E6=A0=91?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0617.合并二叉树.md b/problems/0617.合并二叉树.md
index be6bb425..2ff093a3 100644
--- a/problems/0617.合并二叉树.md
+++ b/problems/0617.合并二叉树.md
@@ -370,6 +370,36 @@ func mergeTrees(t1 *TreeNode, t2 *TreeNode) *TreeNode {
 }
 ```
 
+JavaScript:
+
+```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) {
+    const preOrder = (root1, root2) => {
+        if (!root1)
+            return root2
+        if (!root2)
+            return root1;
+        root1.val += root2.val;
+        root1.left = preOrder(root1.left, root2.left);
+        root1.right = preOrder(root1.right, root2.right);
+        return root1;
+    }
+    return preOrder(root1, root2);
+};
+```
 
 
 -----------------------