卖萌的弱渣

I am stupid, I am hungry.

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.

Solution

(Validate-BST.py) download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

class Solution:
    """
    @param root: The root of binary tree.
    @return: True if the binary tree is BST, or false
    """
    def isValidNode(self,node,upper,lower):
        if node == None:
            return True
        if node.val >= upper or node.val <=lower:
            return False

        if node.left != None and self.isValidNode(node.left,node.val,lower) == False:
            return False
        if node.right != None and self.isValidNode(node.right,upper,node.val) == False:
            return False

        return True
    def isValidBST(self, root):
        # write your code here
        # case: {10,5,15,#,#,6,20} require "upper" and "lower" in recursive
        return self.isValidNode(root,sys.maxint,-sys.maxint-1)