注意二叉树和二叉搜索树的区别
运行时间:27ms
占用内存:5624k
思想就是后序遍历,左右根;而搜索树,一定是左子树都小于根小于右子树。所以后续遍历每次序列的最有一个元素都是序列的中间值。
# -*- coding:utf-8 -*-
class Solution:
def VerifySquenceOfBST(self, sequence):
# write code here
if not sequence:
return False
root = sequence[-1]
for i,item in enumerate(sequence):
if item>root:
for j in sequence[i:]:
if j<root:
return False
return ((not sequence[:i]) or self.VerifySquenceOfBST(sequence[:i])) and ((not sequence[i:-1]) or self.VerifySquenceOfBST(sequence[i:-1]))
return ((not sequence[:i]) or self.VerifySquenceOfBST(sequence[:i])) and ((not sequence[i:-1]) or self.VerifySquenceOfBST(sequence[i:-1]))
______________________________________
看到非递归写法,特别棒
后序遍历这个序列,从右往左遍历,元素值的大小永远是中间值。
运行时间:20ms
占用内存:5856k
# -*- coding:utf-8 -*-
class Solution:
def VerifySquenceOfBST(self, sequence):
# write code here
if not sequence:
return False
while (sequence):
i = 0
while (sequence[i]<sequence[-1]):
i += 1
while (sequence[i]>sequence[-1]):
i += 1
if i<len(sequence)-1:
return False
sequence.pop()
return True