Question: Describe how to modify the skip-list data structure to support the method median(), which returns the position of the element in the bottom list S
Describe how to modify the skip-list data structure to support the method median(), which returns the position of the element in the “bottom” list S0 at index ⌊n/2⌋, Show that your implementation of this method runs in O(logn) expected time.
Step by Step Solution
3.43 Rating (162 Votes )
There are 3 Steps involved in it
Working of the Skip list Lets take an example to understand the working of th... View full answer
Get step-by-step solutions from verified subject matter experts
