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.
Great solution based on the constraints: 0 <= data <= 10^4. This is to utilize BST inorder traversal property. If the data can be min int, then the solution won't work.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Is This a Binary Search Tree?
You are viewing a single comment's thread. Return to all comments →
Great solution based on the constraints: 0 <= data <= 10^4. This is to utilize BST inorder traversal property. If the data can be min int, then the solution won't work.