Suppose you have an empty data structure and do the following operations:
  insert 7, insert 5, insert 20, delete 7, insert 15, insert 3, insert 1, insert 23, insert 17, delete 15

For each of the following data structures, what does it look like after the operations.

Queue (insert is enqueue, delete is dequeue)
  insert 7, insert 5, insert 20, delete, insert 15, insert 3, insert 1, insert 23, insert 17, delete

Binary search tree (not auto-balancing)

Hash table (hash table is size 10, hash function is x % 10)

Unordered array

Ordered array

Stack (insert is push, delete is pop)
  insert 7, insert 5, insert 20, delete, insert 15, insert 3, insert 1, insert 23, insert 17, delete



Also - what is running time for insert/delete/lookup for all of those DS,
       basic description of operations,
       worst and best cases for all of those.