From 878231551829fdd9deea2f2457eb09b794d7ed65 Mon Sep 17 00:00:00 2001
From: Steve2020 <841532108@qq.com>
Date: Wed, 26 Jan 2022 21:20:36 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=EF=BC=880102.=E4=BA=8C?=
 =?UTF-8?q?=E5=8F=89=E6=A0=91=E7=9A=84=E5=B1=82=E5=BA=8F=E9=81=8D=E5=8E=86?=
 =?UTF-8?q?.md=20&=20107.=E4=BA=8C=E5=8F=89=E6=A0=91=E7=9A=84=E5=B1=82?=
 =?UTF-8?q?=E6=AC=A1=E9=81=8D=E5=8E=86=20II=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/0102.二叉树的层序遍历.md | 52 +++++++++++++++++++++++
 1 file changed, 52 insertions(+)

diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
index 1fb9b633..b108c8f0 100644
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@@ -246,7 +246,35 @@ var levelOrder = function(root) {
 
 ```
 
+TypeScript：
+
+```typescript
+function levelOrder(root: TreeNode | null): number[][] {
+    let helperQueue: TreeNode[] = [];
+    let res: number[][] = [];
+    let tempArr: number[] = [];
+    if (root !== null) helperQueue.push(root);
+    let curNode: TreeNode;
+    while (helperQueue.length > 0) {
+        for (let i = 0, length = helperQueue.length; i < length; i++) {
+            curNode = helperQueue.shift()!;
+            tempArr.push(curNode.val);
+            if (curNode.left !== null) {
+                helperQueue.push(curNode.left);
+            }
+            if (curNode.right !== null) {
+                helperQueue.push(curNode.right);
+            }
+        }
+        res.push(tempArr);
+        tempArr = [];
+    }
+    return res;
+};
+```
+
 Swift:
+
 ```swift
 func levelOrder(_ root: TreeNode?) -> [[Int]] {
     var res = [[Int]]()
@@ -454,7 +482,31 @@ var levelOrderBottom = function(root) {
 };
 ```
 
+TypeScript:
+
+```typescript
+function levelOrderBottom(root: TreeNode | null): number[][] {
+    let helperQueue: TreeNode[] = [];
+    let resArr: number[][] = [];
+    let tempArr: number[] = [];
+    let tempNode: TreeNode;
+    if (root !== null) helperQueue.push(root);
+    while (helperQueue.length > 0) {
+        for (let i = 0, length = helperQueue.length; i < length; i++) {
+            tempNode = helperQueue.shift()!;
+            tempArr.push(tempNode.val);
+            if (tempNode.left !== null) helperQueue.push(tempNode.left);
+            if (tempNode.right !== null) helperQueue.push(tempNode.right);
+        }
+        resArr.push(tempArr);
+        tempArr = [];
+    }
+    return resArr.reverse();
+};
+```
+
 Swift:
+
 ```swift
 func levelOrderBottom(_ root: TreeNode?) -> [[Int]] {
     var res =  [[Int]]()