Input: binary tree Output - Boolean - check if it is a binary search tree ..
Logic:
def binary_search_tree(one_tree) nodes = [] nodes.push([one_tree, -Float::INFINITY, Float::INFINITY]) while nodes.any? node, lowest_number, highest_number = nodes.pop return false if ((node.current_value <= lowest_number) || (node.current_value >= highest_number)) nodes.push([node.left, lowest_number, node.current_value]) if node.left nodes.push([node.left, node.current_value, highest_number]) if node.right end true end
This is in O[n] time.
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Input: binary tree
Output - Boolean - check if it is a binary search tree ..
Logic:
This is in O[n] time.