树 98. 验证二叉搜索树 PYTHON

递归 # Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution(object): def isValidBST(self, root): :type root: TreeNode :rtype: bool