"""
Interface for a Binary search Tree.
A BST is a binary tree in symmetric order. Every key to the left of a node are smaller and every key to the right are larger.
"""

class BinarySearchTreeInterface:

    def put(self, key,value):
        pass

    def get(self, key):
        pass

    def delete(self, key):
        pass