From 9cdbbf6f332f7597e671ac9172634a724014bb88 Mon Sep 17 00:00:00 2001
From: thinkasany <480968828@qq.com>
Date: Mon, 14 Aug 2023 00:57:44 +0800
Subject: [PATCH] feat: update ts solution to lc problems: No.0617

---
 .../0600-0699/0617.Merge Two Binary Trees/README.md    | 10 +++++-----
 .../0600-0699/0617.Merge Two Binary Trees/README_EN.md | 10 +++++-----
 .../0600-0699/0617.Merge Two Binary Trees/Solution.ts  | 10 +++++-----
 3 files changed, 15 insertions(+), 15 deletions(-)

diff --git a/solution/0600-0699/0617.Merge Two Binary Trees/README.md b/solution/0600-0699/0617.Merge Two Binary Trees/README.md
index 072c669e4beae..1ae3928b540a9 100644
--- a/solution/0600-0699/0617.Merge Two Binary Trees/README.md	
+++ b/solution/0600-0699/0617.Merge Two Binary Trees/README.md	
@@ -188,11 +188,11 @@ function mergeTrees(
     root1: TreeNode | null,
     root2: TreeNode | null,
 ): TreeNode | null {
-    if (root1 == null && root2 == null) return null;
-    if (root1 == null) return root2;
-    if (root2 == null) return root1;
-    let left = mergeTrees(root1.left, root2.left);
-    let right = mergeTrees(root1.right, root2.right);
+    if (root1 === null && root2 === null) return null;
+    if (root1 === null) return root2;
+    if (root2 === null) return root1;
+    const left = mergeTrees(root1.left, root2.left);
+    const right = mergeTrees(root1.right, root2.right);
     return new TreeNode(root1.val + root2.val, left, right);
 }
 ```
diff --git a/solution/0600-0699/0617.Merge Two Binary Trees/README_EN.md b/solution/0600-0699/0617.Merge Two Binary Trees/README_EN.md
index 4d2dfc41df1f4..34a33a7707da0 100644
--- a/solution/0600-0699/0617.Merge Two Binary Trees/README_EN.md	
+++ b/solution/0600-0699/0617.Merge Two Binary Trees/README_EN.md	
@@ -169,11 +169,11 @@ function mergeTrees(
     root1: TreeNode | null,
     root2: TreeNode | null,
 ): TreeNode | null {
-    if (root1 == null && root2 == null) return null;
-    if (root1 == null) return root2;
-    if (root2 == null) return root1;
-    let left = mergeTrees(root1.left, root2.left);
-    let right = mergeTrees(root1.right, root2.right);
+    if (root1 === null && root2 === null) return null;
+    if (root1 === null) return root2;
+    if (root2 === null) return root1;
+    const left = mergeTrees(root1.left, root2.left);
+    const right = mergeTrees(root1.right, root2.right);
     return new TreeNode(root1.val + root2.val, left, right);
 }
 ```
diff --git a/solution/0600-0699/0617.Merge Two Binary Trees/Solution.ts b/solution/0600-0699/0617.Merge Two Binary Trees/Solution.ts
index 4ad31534a83a4..005f54c67950f 100644
--- a/solution/0600-0699/0617.Merge Two Binary Trees/Solution.ts	
+++ b/solution/0600-0699/0617.Merge Two Binary Trees/Solution.ts	
@@ -16,10 +16,10 @@ function mergeTrees(
     root1: TreeNode | null,
     root2: TreeNode | null,
 ): TreeNode | null {
-    if (root1 == null && root2 == null) return null;
-    if (root1 == null) return root2;
-    if (root2 == null) return root1;
-    let left = mergeTrees(root1.left, root2.left);
-    let right = mergeTrees(root1.right, root2.right);
+    if (root1 === null && root2 === null) return null;
+    if (root1 === null) return root2;
+    if (root2 === null) return root1;
+    const left = mergeTrees(root1.left, root2.left);
+    const right = mergeTrees(root1.right, root2.right);
     return new TreeNode(root1.val + root2.val, left, right);
 }