def isValidBST(self, root: TreeNode) ->bool:
    res = []

    def inorder(node):
        if node:
            if node.left:
                inorder(node.left)
            res.append(node.val)
            if node.right:
                inorder(node.right)
    inorder(root)
    print(res)
    for i in range(1, len(res)):
        if res[i] <= res[i - 1]:
            return False
    return True

07f9e6cd48fd7b555db258faeddec69ebfbb61e3
<mask token>

def isValidBST(self, root: TreeNode) ->bool:
    res = []

    def inorder(node):
        if node:
            if node.left:
                inorder(node.left)
            res.append(node.val)
            if node.right:
                inorder(node.right)
    inorder(root)
    print(res)
    for i in range(1, len(res)):
        if res[i] <= res[i - 1]:
            return False
    return True
