You are viewing a single comment's thread. Return to all comments →
Isn't it that all nodes in left tree should be less than root and right should be greater than root. Than why we need to find min and max.
Seems like cookies are disabled on this browser, please enable them to open this website
An unexpected error occurred. Please try reloading the page. If problem persists, please contact support@hackerrank.com
Is This a Binary Search Tree?
You are viewing a single comment's thread. Return to all comments →
Isn't it that all nodes in left tree should be less than root and right should be greater than root. Than why we need to find min and max.