You are viewing a single comment's thread. Return to all comments →
I took your solution and enhanced it with one overloaded function:
def checkBST(root , min=float('-inf'), max=float('+inf')): if root == None: return True if root.data <= min or root.data >= max: return False return checkBST(root.left, min, root.data) and checkBST(root.right, root.data, max)
Trees: Is This a Binary Search Tree?
You are viewing a single comment's thread. Return to all comments →
I took your solution and enhanced it with one overloaded function:
def checkBST(root , min=float('-inf'), max=float('+inf')): if root == None: return True if root.data <= min or root.data >= max: return False return checkBST(root.left, min, root.data) and checkBST(root.right, root.data, max)