Leetcode 98. 验证二叉搜索树python

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def ValidBST(self, root,small,large):
        """
        :type root: TreeNode
        :rtype: bool
        """
        if(root==None):
            return True
        elif(small>=root.val or large<= root.val):
            return False
        else:
            return self.ValidBST(root.left,small,root.val) and self.ValidBST(root.right,root.val,large)
        
    def isValidBST(self,root,):
        
        return self.ValidBST(root,-2**32,2**32-1)