# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def dfs(self,root,lower,higher):
if root==None:
return True
if root.val<=lower:
return False
if root.val>=higher:
return False
return self.dfs(root.left,lower,root.val) and self.dfs(root.right,root.val,higher)
def isValidBST(self, root: TreeNode) -> bool:
return self.dfs(root,-float('inf'),float('inf'))
判断一棵树是不是二叉排序树
最新推荐文章于 2023-12-02 11:20:11 发布