# =-=-=-= DAY 89 [Medium] =-=-=-=
#
# Determine whether a tree is a valid binary search tree.
# 
# A binary search tree is a tree with two children, left and right, and satisfies
# the constraint that the key in the left child must be less than or equal to the
# root and the key in the right child must be greater than or equal to the root.
