A) What is a skiplist? What is the space complexity of the skiplist?

B)

What are the necessary functions of a skiplist? (Provide UML if useful.) What is the running time of each of these functions?

C)

What data structures are competitors or alternatives to a skiplist? How does the skiplist compare to its

competition i.e. running time, and other advantages / disadvantages?

D)

Compare the skiplist against at least one of the skiplist competitors with respect to wall clock time .Create a chart for 10 n values with at least 50,000 items difference between any two n values