Clone this repository onto your local machine.
Setup a Python virtual environment for use with this exercise.
Inspect the code in testcases.py and run the test cases.
Implement the is_search_tree function defined in exercise_bst.py. A successful implementation should see all three tests pass.
Replace the list of integers used to build the Linear binary tree test case with a list comprehension.
In exercise_bst.py implement and apply a decorator which prints the binary tree passed to the is_search_tree function.
Hint: print(binary_tree) pretty-prints the binary_tree object