0. 题目
1. 递归 o(n) o(n) 传参lower、higher为左/右子树的边界
class Solution:
def isValidBST(self, root):
def helper(node,lower=float('-inf'),upper=float('inf')):
if not node: return True
val = node.val
if val<=lower or val>=upper:
return False
if not helper(node.right,val,upper):
return False
if not helper(node.left,lower,val):
return False
return True
return helper(root)