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.
Ummm ..
1. When you visit the nodes that are left of the root, do you inspect all nodes (even the right nodes of subnodes), to find the max?
2. When checking the right subnodes, are you initializing the value to a high-value (not 0) since you are looking for min?
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 →
Ummm .. 1. When you visit the nodes that are left of the root, do you inspect all nodes (even the right nodes of subnodes), to find the max? 2. When checking the right subnodes, are you initializing the value to a high-value (not 0) since you are looking for min?