From 19b7541a7ec06e19638ed680c96cc99beea57f18 Mon Sep 17 00:00:00 2001
From: kok-s0s <2694308562@qq.com>
Date: Mon, 21 Jun 2021 15:51:11 +0800
Subject: [PATCH] =?UTF-8?q?JavaScript=E7=89=88=E6=9C=AC=E7=9A=84=E3=80=8A?=
 =?UTF-8?q?=E9=AA=8C=E8=AF=81=E4=BA=8C=E5=8F=89=E6=90=9C=E7=B4=A2=E6=A0=91?=
 =?UTF-8?q?=E3=80=8B?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0098.验证二叉搜索树.md | 69 ++++++++++++++++++++++++++
 1 file changed, 69 insertions(+)

diff --git a/problems/0098.验证二叉搜索树.md b/problems/0098.验证二叉搜索树.md
index eb877abb..e38c5ade 100644
--- a/problems/0098.验证二叉搜索树.md
+++ b/problems/0098.验证二叉搜索树.md
@@ -377,6 +377,75 @@ func isBST(root *TreeNode, min, max int) bool {
 }
 ```
 
+JavaScript版本
+
+> 辅助数组解决
+
+```javascript
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {boolean}
+ */
+var isValidBST = function (root) {
+    let arr = [];
+    const buildArr = (root) => {
+        if (root) {
+            buildArr(root.left);
+            arr.push(root.val);
+            buildArr(root.right);
+        }
+    }
+    buildArr(root);
+    for (let i = 1; i < arr.length; ++i) {
+        if (arr[i] <= arr[i - 1])
+            return false;
+    }
+    return true;
+};
+```
+
+> 递归中解决
+
+```javascript
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {boolean}
+ */
+let pre = null;
+var isValidBST = function (root) {
+    let pre = null;
+    const inOrder = (root) => {
+        if (root === null)
+            return true;
+        let left = inOrder(root.left);
+
+        if (pre !== null && pre.val >= root.val)
+            return false;
+        pre = root;
+
+        let right = inOrder(root.right);
+        return left && right;
+    }
+    return inOrder(root);
+};
+```
+
 
 
 -----------------------