描述的树的中序历遍
有改进方法
class Solution(object):
def isValidBST(self, root):
self.list = []
self.inorder(root)
for index in range(1, len(self.list)):
if self.list[index] <= self.list[index-1]:
return False
return True
def inorder(self, root):
if not root:
return
self.inorder(root.left)
self.list.append(root.val)
self.inorder(root.right)