CS 241 Lab 2
The following files are being provided:
o stdinc.h The standard include file

o rand-flip-ex.cc --- The example program to generate random coin flips

o sample-output --- This gives a sample output for the print and search procedures to show you ONE acceptable form for the output.

Here is the sequence of operations you are to use as test data for lab 3. You are welcome to have the needed calls to your Skip List class/procedures made directly from main. You are also welcome to decide whether, for example, the insert method/procedure takes as an argument the key of the item to insert or a pointer to the node to be inserted. Likewise for other operations like delete. For search it may be a good idea to print whether or not the given item was found (i.e. if value returned was nil then it was not found, otherwise it was found). You may assume all keys are between 1 and 1000.

If you have any questions just ask. 

Insert 89
Insert 455
Insert 837
Insert 333
Insert 241
Insert 10
Insert 925
Insert 507
Insert 600
Insert 75
Print
Search 241
Search 837
Search 500
Search 333
Search 650
Then if you did the "A" part demonstrate whichever of the below operations you implemented: 
Maximum
Search 837
Successor (of 837)
Successor (of successor of 837)
Delete 10
Delete 600
Delete 75
Delete 925
Print
Search 89
Search 507
Search 300