Python Dictionary Binary Search Tree

Question

I am struggling to get to know how to code a basic implementation using a dictionary and in-order traversal binary search tree in Python. The class have to be using the below structure.

I would be very happy if someone could fill out the blanks (pass) in each function to get me started.

class Dictionary:

    def __init__ (self):

        pass

    def insert (self, key, value):

        pass

    def delete (self, key):

        pass

    def find (self, key):

        pass

    def traverse (self, f):

        pass

    def __str__ (self):

        return str(self)

Answer 1

class Dictionary:
    def __init__ (self):
        self.data = {}
    def insert (self, key, value):
        self.data[key] = value
    def delete (self, key):
        if key in self.data:
            del self.data[key]
    def find (self, key):
        if key in self.data:
            return self.data[key]
        return None
    def traverse (self, f):
        for key,value in self.data:
            f(key,value)
    def __str__ (self):
        return str(self)

Answer 2

binary tree

You may want to use the array representation of a binary tree. Python has a powerful list data type which will make most of the work trivial. :)

class BinaryTree():
  def __init__(self):
     self.nodes = []

Here, that's a foundation you can start from.