Question: (2) Consider the skip list data structure. Suppose that we use only two levels, i.e., two (sorted) linked lists, for n elements. Each element
(2) Consider the skip list data structure. Suppose that we use only two levels, i.e., two (sorted) linked lists, for n elements. Each element is in linked list So and some elements are also in the other linked list S. Please draw the skip list structure where the minimized search cost is O(n). (2 pts)
Step by Step Solution
There are 3 Steps involved in it
In a skip list with two levels we typically have a bottom level level 0 containing all elements and ... View full answer
Get step-by-step solutions from verified subject matter experts
