Binary Search Tree

Write a program binary_search_tree.py that implements a BinarySearchTree class, which consists of a binary search tree made up of TreeNode objects as described in the text.

Once you've created the file with those two classes defined, create a main program that:

1. creates an empty binary search tree

2. puts the following keys into the tree in this order (each key can have a value of None):

    5
    3
    1
    9
    12
    13
    15

3. print out the result of calling get(5) on the tree
4. print out the result of calling get(10) on the tree

5. execute the following for loop on your tree:

    for item in bst:
        print(item)

6. What does the binary tree actually look like? Draw a picture of the tree, beginning at its root 5.