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.
Isn't necessary to store the values in a list, just keep track of the previous visited value (inorder sequence), and if your current visiting value is less than it means that isn't a BST
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Is This a Binary Search Tree?
You are viewing a single comment's thread. Return to all comments →
Isn't necessary to store the values in a list, just keep track of the previous visited value (inorder sequence), and if your current visiting value is less than it means that isn't a BST