From bd2310622b8a4d726288759820a60b5a62fce590 Mon Sep 17 00:00:00 2001
From: Steve2020 <841532108@qq.com>
Date: Thu, 17 Feb 2022 10:25:56 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=EF=BC=880700.=E4=BA=8C?=
 =?UTF-8?q?=E5=8F=89=E6=90=9C=E7=B4=A2=E6=A0=91=E4=B8=AD=E7=9A=84=E6=90=9C?=
 =?UTF-8?q?=E7=B4=A2.md=EF=BC=89=EF=BC=9A=E5=A2=9E=E5=8A=A0typescript?=
 =?UTF-8?q?=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0700.二叉搜索树中的搜索.md | 30 ++++++++++++++++++++
 1 file changed, 30 insertions(+)

diff --git a/problems/0700.二叉搜索树中的搜索.md b/problems/0700.二叉搜索树中的搜索.md
index 1521514a..00ba8753 100644
--- a/problems/0700.二叉搜索树中的搜索.md
+++ b/problems/0700.二叉搜索树中的搜索.md
@@ -334,6 +334,36 @@ var searchBST = function (root, val) {
 };
 ```
 
+## TypeScript
+
+> 递归法
+
+```typescript
+function searchBST(root: TreeNode | null, val: number): TreeNode | null {
+    if (root === null || root.val === val) return root;
+    if (root.val < val) return searchBST(root.right, val);
+    if (root.val > val) return searchBST(root.left, val);
+    return null;
+};
+```
+
+> 迭代法
+
+```typescript
+function searchBST(root: TreeNode | null, val: number): TreeNode | null {
+    let resNode: TreeNode | null = root;
+    while (resNode !== null) {
+        if (resNode.val === val) return resNode;
+        if (resNode.val < val) {
+            resNode = resNode.right;
+        } else {
+            resNode = resNode.left;
+        }
+    }
+    return null;
+};
+```
+
 
 
 -----------------------