Problem 36

This is the archived version of this course from the Spring 2013 semester. You might find something more recent by visitning my teaching page.

(Note: you should probably start by doing Problem 35.)

What if a skip list were restricted to *k* levels, for some constant *k*? What would be the optimum way of storing *n* items in a skip-list of height *k*, and what would the resulting cost of search, insert, and delete be?

Describe the data structure construction (briefly). Give a big-O bound in terms of *n* and *k*. Then show how this relates to the usual skip list with expected height \(k = \lg n\).