You are viewing a single comment's thread. Return to all comments →
This would return false. Inorder 8 -> 18 -> 10
18 > 10
As long as the last element is the last elemented "visited" and not last element passed by.
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 →
This would return false. Inorder 8 -> 18 -> 10
18 > 10
As long as the last element is the last elemented "visited" and not last element passed by.