From 47818c947888ecff3dae6f36daded1cfaf92db3b Mon Sep 17 00:00:00 2001
From: Steve2020 <841532108@qq.com>
Date: Tue, 8 Feb 2022 10:23:59 +0800
Subject: [PATCH 1/2] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=EF=BC=88=E4=BA=8C?=
 =?UTF-8?q?=E5=8F=89=E6=A0=91=E4=B8=AD=E9=80=92=E5=BD=92=E5=B8=A6=E7=9D=80?=
 =?UTF-8?q?=E5=9B=9E=E6=BA=AF.md=EF=BC=89=EF=BC=9A=E5=A2=9E=E5=8A=A0?=
 =?UTF-8?q?=E7=9B=B8=E5=90=8C=E7=9A=84=E6=A0=91typescript=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/二叉树中递归带着回溯.md | 23 ++++++++++++++++++++++
 1 file changed, 23 insertions(+)

diff --git a/problems/二叉树中递归带着回溯.md b/problems/二叉树中递归带着回溯.md
index 20b87f87..03815ed3 100644
--- a/problems/二叉树中递归带着回溯.md
+++ b/problems/二叉树中递归带着回溯.md
@@ -515,6 +515,29 @@ var binaryTreePaths = function(root) {
 };
 ```
 
+TypeScript：
+
+> 相同的树
+
+```typescript
+function isSameTree(p: TreeNode | null, q: TreeNode | null): boolean {
+    if (p === null && q === null) return true;
+    if (p === null || q === null) return false;
+    if (p.val !== q.val) return false;
+    let bool1: boolean, bool2: boolean;
+    bool1 = isSameTree(p.left, q.left);
+    bool2 = isSameTree(p.right, q.right);
+    return bool1 && bool2;
+};
+```
+
+> 二叉树的不同路径
+
+```typescript
+```
+
+
+
 
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>

From 49a1a42bbed494b10b4d6659ba787830f62bd842 Mon Sep 17 00:00:00 2001
From: Steve2020 <841532108@qq.com>
Date: Tue, 8 Feb 2022 10:45:15 +0800
Subject: [PATCH 2/2] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=EF=BC=88=E4=BA=8C?=
 =?UTF-8?q?=E5=8F=89=E6=A0=91=E4=B8=AD=E9=80=92=E5=BD=92=E5=B8=A6=E7=9D=80?=
 =?UTF-8?q?=E5=9B=9E=E6=BA=AF.md=EF=BC=89=EF=BC=9A=E5=A2=9E=E5=8A=A0?=
 =?UTF-8?q?=E4=BA=8C=E5=8F=89=E6=A0=91=E7=9A=84=E4=B8=8D=E5=90=8C=E8=B7=AF?=
 =?UTF-8?q?=E5=BE=84=E7=9A=84typescript=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/二叉树中递归带着回溯.md | 21 +++++++++++++++++++++
 1 file changed, 21 insertions(+)

diff --git a/problems/二叉树中递归带着回溯.md b/problems/二叉树中递归带着回溯.md
index 03815ed3..41d5663e 100644
--- a/problems/二叉树中递归带着回溯.md
+++ b/problems/二叉树中递归带着回溯.md
@@ -534,6 +534,27 @@ function isSameTree(p: TreeNode | null, q: TreeNode | null): boolean {
 > 二叉树的不同路径
 
 ```typescript
+function binaryTreePaths(root: TreeNode | null): string[] {
+    function recur(node: TreeNode, nodeSeqArr: number[], resArr: string[]): void {
+        nodeSeqArr.push(node.val);
+        if (node.left === null && node.right === null) {
+            resArr.push(nodeSeqArr.join('->'));
+        }
+        if (node.left !== null) {
+            recur(node.left, nodeSeqArr, resArr);
+            nodeSeqArr.pop();
+        }
+        if (node.right !== null) {
+            recur(node.right, nodeSeqArr, resArr);
+            nodeSeqArr.pop();
+        }
+    }
+    let nodeSeqArr: number[] = [];
+    let resArr: string[] = [];
+    if (root === null) return resArr;
+    recur(root, nodeSeqArr, resArr);
+    return resArr;
+};
 ```