From 2386694b5b67e1ec17e42ce2c1f9df784eaeab24 Mon Sep 17 00:00:00 2001
From: Steve2020 <841532108@qq.com>
Date: Sat, 11 Jun 2022 00:43:30 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=EF=BC=880100.=E7=9B=B8?=
 =?UTF-8?q?=E5=90=8C=E7=9A=84=E6=A0=91.md=EF=BC=89=EF=BC=9A=E5=A2=9E?=
 =?UTF-8?q?=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/0100.相同的树.md | 40 +++++++++++++++++++++++++++++++++++
 1 file changed, 40 insertions(+)

diff --git a/problems/0100.相同的树.md b/problems/0100.相同的树.md
index 5e805d01..d2431f39 100644
--- a/problems/0100.相同的树.md
+++ b/problems/0100.相同的树.md
@@ -240,6 +240,46 @@ Go：
 
 JavaScript：
 
+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;
+    return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
+};
+```
+
+> 迭代法-层序遍历
+
+```typescript
+function isSameTree(p: TreeNode | null, q: TreeNode | null): boolean {
+    const queue1: (TreeNode | null)[] = [],
+        queue2: (TreeNode | null)[] = [];
+    queue1.push(p);
+    queue2.push(q);
+    while (queue1.length > 0 && queue2.length > 0) {
+        const node1 = queue1.shift(),
+            node2 = queue2.shift();
+        if (node1 === null && node2 === null) continue;
+        if (
+            (node1 === null || node2 === null) ||
+            node1!.val !== node2!.val
+        ) return false;
+        queue1.push(node1!.left);
+        queue1.push(node1!.right);
+        queue2.push(node2!.left);
+        queue2.push(node2!.right);
+    }
+    return true;
+};
+```
+
+
+
 
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>