From fac4fc5193caac05a5418338f281e25c02a2739b Mon Sep 17 00:00:00 2001
From: Steve2020 <841532108@qq.com>
Date: Wed, 16 Feb 2022 23:22:26 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=EF=BC=880617.=E5=90=88?=
 =?UTF-8?q?=E5=B9=B6=E4=BA=8C=E5=8F=89=E6=A0=91.md=EF=BC=89=EF=BC=9A?=
 =?UTF-8?q?=E5=A2=9E=E5=8A=A0typescript=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0617.合并二叉树.md b/problems/0617.合并二叉树.md
index f815d741..55786ea9 100644
--- a/problems/0617.合并二叉树.md
+++ b/problems/0617.合并二叉树.md
@@ -583,6 +583,56 @@ var mergeTrees = function(root1, root2) {
 
 ```
 
+## TypeScript
+
+> 递归法：
+
+```type
+function mergeTrees(root1: TreeNode | null, root2: TreeNode | null): TreeNode | null {
+    if (root1 === null) return root2;
+    if (root2 === null) return root1;
+    const resNode: TreeNode = new TreeNode(root1.val + root2.val);
+    resNode.left = mergeTrees(root1.left, root2.left);
+    resNode.right = mergeTrees(root1.right, root2.right);
+    return resNode;
+};
+```
+
+> 迭代法：
+
+```typescript
+function mergeTrees(root1: TreeNode | null, root2: TreeNode | null): TreeNode | null {
+    if (root1 === null) return root2;
+    if (root2 === null) return root1;
+    const helperQueue1: TreeNode[] = [],
+        helperQueue2: TreeNode[] = [];
+    helperQueue1.push(root1);
+    helperQueue2.push(root2);
+    let tempNode1: TreeNode,
+        tempNode2: TreeNode;
+    while (helperQueue1.length > 0) {
+        tempNode1 = helperQueue1.shift()!;
+        tempNode2 = helperQueue2.shift()!;
+        tempNode1.val += tempNode2.val;
+        if (tempNode1.left !== null && tempNode2.left !== null) {
+            helperQueue1.push(tempNode1.left);
+            helperQueue2.push(tempNode2.left);
+        } else if (tempNode1.left === null) {
+            tempNode1.left = tempNode2.left;
+        }
+        if (tempNode1.right !== null && tempNode2.right !== null) {
+            helperQueue1.push(tempNode1.right);
+            helperQueue2.push(tempNode2.right);
+        } else if (tempNode1.right === null) {
+            tempNode1.right = tempNode2.right;
+        }
+    }
+    return root1;
+};
+```
+
+
+
 
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>