Python刷leetcode--98.验证二叉搜索树

class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

    # 按照中序遍历的方式遍历，中序遍历的顺序是左中右，只要 左面小于中间
    # 中间小于右面 就满足条件了


class Solution:
    pre = -sys.maxsize - 1

    def isValidBST(self, root: TreeNode) -> bool:
        if not root:
            return True
        if not self.isValidBST(root.left):
            return False
        if root.val <= self.pre:
            return False
        self.pre = root.val
        return self.isValidBST(root.right)

加油