输入一个整数数组,判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。
class Solution:
def VerigySquenceOfBST(self, sequence):
if sequence == None or sequence == []: #序列不存在或者为空
return False
root = sequence[-1]
for i in range(len(sequence)):
if sequence[i] > root:
break
p = i
for j in range(p, len(sequence)):
if sequence[j] < root:
return False
left = True #左右子树先默认是,因为后面都是在判断不是
if p > 0: #要有左子树
left = self.VerifySquenceOfBST(sequence[:p])
right = True
if p < len(sequence) - 1:
right = self.VerifySquenceOfBST(sequence[p:-1])
return left and right