Discussion on Trees: Is This a Binary Search Tree? Challenge

vovanec 3 years ago+ 1 comment

One more version in Python:

def check(root, min_, max_):
    return (root is None or 
            (root.data < max_ and root.data > min_ and 
             check(root.left, min_, root.data) and 
             check(root.right, root.data, max_)))

def check_binary_search_tree_(root):
    return check(root, -float('inf'), float('inf'))

RyanayR 3 years ago+ 0 comments

Very nice solution! My only stylistic suggestion is to replace

root.data < max_ and root.data > min_

in the third line with

min_ < root.data < max_

for ease of reading/brevity.