Follow-up traversal of binary search tree

The title description enters an array of integers to determine if the array is the result of a sequential traversal of a binary search tree. If yes, output yes, otherwise output No. Assume that any two digits of the input array are different.

#-*-Coding:utf-8-*-class Solution:    def verifysquenceofbst (self, Sequence):        # Write code here        if not Sequen CE:            return False        root = sequence[-1]        i = 0        while sequence[i] < root:            i = i+ 1        for J in range (I, Len (Sequence)-1):            if SEQUENCE[J] < root:                return False Left        = sequence[:i] Right        =sequence[i:len (sequence)-1]        leftis = True        rightis =true        If Len (left) > 0:            leftis = self. Verifysquenceofbst (left)        if Len (right) > 0:            rightis = self. Verifysquenceofbst (right)        return Leftis and Rightis

Follow-up traversal of binary search tree