Given a binary tree, determine if it is a valid binary search tree (BST).
Assume a BST is defined as follows:
- The left subtree of a node contains only nodes with keys less than the node's key.
- The right subtree of a node contains only nodes with keys greater than the node's key.
- Both the left and right subtrees must also be binary search trees.
思路: 最常规的错误就是,递归遍历每个点,判断是否大于左节点,并且小于右节点。错误在于,每个节点的值应该跟他的parent比较,而不是child。因为对于一个节点,整个左子树都比他小,整个右子树都比他大,而他如果是左节点,则比他得parent小,vice versa。所以我们只需要比较节点和parent,刚开始要设置一个无穷大的右节点和无穷小的左节点。
# Definition for a binary tree node
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
# @param root, a tree node
# @return a boolean
def checkBST(self, root, left, right):
if root == None:
return True
return root.val > left and root.val < right and self.checkBST(root.left, left, root.val) and self.checkBST(root.right, root.val, right)
def isValidBST(self, root):
return self.checkBST(root, -30000000000000, 3000000000000)