We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. Tutorials
  3. Cracking the Coding Interview
  4. Trees: Is This a Binary Search Tree?
  5. Discussions

Trees: Is This a Binary Search Tree?

  • vovanec + 1 comment

    One more version in Python:

    def check(root, min_, max_):
    return (root is None or 
            (root.data < max_ and root.data > min_ and 
             check(root.left, min_, root.data) and 
             check(root.right, root.data, max_)))

def check_binary_search_tree_(root):
    return check(root, -float('inf'), float('inf'))
    • RyanayR + 0 comments

      Very nice solution! My only stylistic suggestion is to replace 

      root.data < max_ and root.data > min_

      in the third line with 

      min_ < root.data < max_

      for ease of reading/brevity.