(2) Consider the skip list data structure. Suppose that we use only two levels, i.e., two...

Transcribed Image Text:

(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) (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)

Answer rating: 100% (QA)

In a skip list with two levels we typically have a bottom level level 0 containing all elements and ... View the full answer