Your mission is to benchmark the data structures we've done in class so far.  Just
to review, the data structures are:

	Linked list
	Bitmap of bits
	Deq
	Hash Table
	AVL Tree
	
Every one of these data structures can implement the operations insert, delete and test.
Note that graphs are fundementally different from these data strucures above, and therefore
we'll not be testing them.

Your mission is to time each of these data structures.  

You will make sure that each of the data structures has a constructor with the same 
signature.  They will also have a insert, delete, and contains with the same 
signature.  (1 point)

You will write a benchmarking program that can gather the time, do some operations, and
then gathers the time again.  You will time a null loop.  (1 point)

You will time each of the data structures.  You get 0.5 points for each data point
taken.  There should be 25 data points. Do the following:

	For each data structure and data size
		Fill the data structures with random integers.  Use 'size' integers.
		Insert and delete a random integer.  Do this 'count' time.
		Plot the point (size, duration/count).

Plot these points onto a graph.  (2 point).  Fit the graph data with the theoretical
O() function.  (3 points)