验证有效二叉搜索树

Validate Binary Search Tree

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.

Example 1:

    2
   / \
  1   3

Input: [2,1,3]
Output: true

Example 2:

    5
   / \
  1   4
     / \
    3   6

Input: [5,1,4,null,null,3,6]
Output: false
Explanation: The root node's value is 5 but its right child's value is 4.

递归法

class Solution:
    def isValidBST(self, root: TreeNode) -> bool:
        return self.helper(root,float("inf"),float("-inf"))
        
    def helper(self,root,up,low):
        if root is None:
            return True
        if root.val<up and root.val>low:
            return self.helper(root.left,root.val,low) and self.helper(root.right,up,root.val)
        else:
            return False
        

迭代法，基本上二叉树问题都能有迭代和递归做，而且迭代需要一个辅助的栈

class Solution:
    def isValidBST(self, root: TreeNode) -> bool:
        if not root:
            return True
        stack = [(root,float("inf"),float("-inf"))]
        while stack:
            tmpNode,upper,lower=stack.pop()
            if not tmpNode:
                continue
            val = tmpNode.val
            if val<=lower or val>=upper:
                return False
            stack.append((tmpNode.right,upper,val))
            stack.append((tmpNode.left,val,lower))
        return True