From 53168265e88a903257da119c1522a081675b2fbd Mon Sep 17 00:00:00 2001
From: jojoo15 <75017412+jojoo15@users.noreply.github.com>
Date: Tue, 18 May 2021 15:35:24 +0200
Subject: [PATCH] =?UTF-8?q?Update=200098.=E9=AA=8C=E8=AF=81=E4=BA=8C?=
=?UTF-8?q?=E5=8F=89=E6=90=9C=E7=B4=A2=E6=A0=91.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
python version of code added
---
problems/0098.验证二叉搜索树.md | 24 +++++++++++++++++++++---
1 file changed, 21 insertions(+), 3 deletions(-)
diff --git a/problems/0098.验证二叉搜索树.md b/problems/0098.验证二叉搜索树.md
index d8945eff..a3f78c39 100644
--- a/problems/0098.验证二叉搜索树.md
+++ b/problems/0098.验证二叉搜索树.md
@@ -336,8 +336,26 @@ class Solution {
```
Python：
-
-
+```python
+# Definition for a binary tree node.
+# class TreeNode:
+# def __init__(self, val=0, left=None, right=None):
+# self.val = val
+# self.left = left
+# self.right = right
+//递归法
+class Solution:
+ def isValidBST(self, root: TreeNode) -> bool:
+ res = [] //把二叉搜索树按中序遍历写成list
+ def buildalist(root):
+ if not root: return
+ buildalist(root.left) //左
+ res.append(root.val) //中
+ buildalist(root.right) //右
+ return res
+ buildalist(root)
+ return res == sorted(res) and len(set(res)) == len(res) //检查list里的数有没有重复元素，以及是否按从小到大排列
+```
Go：
```Go
import "math"
@@ -365,4 +383,4 @@ func isBST(root *TreeNode, min, max int) bool {
* 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)
* B站视频：[代码随想录](https://space.bilibili.com/525438321)
* 知识星球：[代码随想录](https://mp.weixin.qq.com/s/QVF6upVMSbgvZy8lHZS3CQ)
-
\ No newline at end of file
+
