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.
#A tree is a binary tree if its inorder traversal is sorted
a = []
def checkBST(root):
if not root : return True
def inorder(root):
if root.left :
inorder(root.left)
a.append(root.data)
if root.right:
inorder(root.right)
inorder(root)
return a==sorted(list(set(a)))
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Trees: Is This a Binary Search Tree?
You are viewing a single comment's thread. Return to all comments →