From a488a3414a8c0e3408678f8393b116837e6240ea Mon Sep 17 00:00:00 2001
From: Steve2020 <841532108@qq.com>
Date: Mon, 24 Jan 2022 20:25:45 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=EF=BC=88=E4=BA=8C=E5=8F=89?=
 =?UTF-8?q?=E6=A0=91=E7=9A=84=E9=80=92=E5=BD=92=E9=81=8D=E5=8E=86.md?=
 =?UTF-8?q?=EF=BC=89=EF=BC=9A=E5=A2=9E=E5=8A=A0typescript=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 | 44 ++++++++++++++++++++++++++++
 1 file changed, 44 insertions(+)

diff --git a/problems/二叉树的递归遍历.md b/problems/二叉树的递归遍历.md
index 4beed650..ba13fc74 100644
--- a/problems/二叉树的递归遍历.md
+++ b/problems/二叉树的递归遍历.md
@@ -358,7 +358,51 @@ var postorderTraversal = function(root) {
 };
 ```
 
+TypeScript:
+
+```typescript
+// 前序遍历
+function preorderTraversal(node: TreeNode | null): number[] {
+    function traverse(node: TreeNode | null, res: number[]): void {
+        if (node === null) return;
+        res.push(node.val);
+        traverse(node.left, res);
+        traverse(node.right, res);
+    }
+    const res: number[] = [];
+    traverse(node, res);
+    return res;
+}
+
+// 中序遍历
+function inorderTraversal(node: TreeNode | null): number[] {
+    function traverse(node: TreeNode | null, res: number[]): void {
+        if (node === null) return;
+        traverse(node.left, res);
+        res.push(node.val);
+        traverse(node.right, res);
+    }
+    const res: number[] = [];
+    traverse(node, res);
+    return res;
+}
+
+// 后序遍历
+function postorderTraversal(node: TreeNode | null): number[] {
+    function traverse(node: TreeNode | null, res: number[]): void {
+        if (node === null) return;
+        traverse(node.left, res);
+        traverse(node.right, res);
+        res.push(node.val);
+    }
+    const res: number[] = [];
+    traverse(node, res);
+    return res;
+}
+```
+
 C:
+
 ```c
 //前序遍历：
 void preOrderTraversal(struct TreeNode* root, int* ret, int* returnSize) {