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.
this will keep 2 values to compare each node to: a minimum on the left branch and a maximum on the right branch. if we go on the left branch we update the lv to the new minimum. if we go to the right we update the rv to the new maximum.
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 →
my solution:
this will keep 2 values to compare each node to: a minimum on the left branch and a maximum on the right branch. if we go on the left branch we update the lv to the new minimum. if we go to the right we update the rv to the new maximum.