lav-patel/binary-tree

1. Clone Repository

Clone this repository onto your local machine.

2. Setup Virtual Environment

Setup a Python virtual environment for use with this exercise.

3. Run Test Cases

Inspect the code in testcases.py and run the test cases.

4. Implement a Binary Search Tree Test Function

Implement the is_search_tree function defined in exercise_bst.py. A successful implementation should see all three tests pass.

5. Use a List Comprehension

Replace the list of integers used to build the Linear binary tree test case with a list comprehension.

6. Create a Decorator

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