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. Prepare
  2. Data Structures
  3. Trees
  4. Is This a Binary Search Tree?
  5. Discussions

Is This a Binary Search Tree?

  • cameronellis711
     + 0 comments

    This is great! I coded the solution to this problem in accordance with your comment!

    prevVal = -1
resultVal = 1

def check_binary_search_tree_(root):
  inOrder(root)
  if resultVal == 1:
    return True
  elif resultVal == 0:
    return False

# perform an in order traversal 
def inOrder(root):
  if root is None:
    return
  else:
    inOrder(root.left)
     
    global prevVal
    if prevVal < root.data:
      prevVal = root.data
    else:
      global resultVal
      resultVal = 0
      return
    
    inOrder(root.right)