class Solution:
def helper(self,root,low=float('-inf'),upper=float('inf')):
val=root.val
if val<=low or val>=upper:
return False
if root.left is not None:
if self.helper(root.left,low,val) is False:
return False
if root.right is not None:
if self.helper(root.right,val,upper) is False:
return False
return True
def isValidBST(self, root: TreeNode) -> bool:
if root is None:
return True
return self.helper(root)
leetcode6——验证二叉搜索树
最新推荐文章于 2022-12-20 17:05:20 发布