Lists on Data Structure and Algorithms related Questions and Answers

Question :   What is the time complexity improvement of skip lists from linked lists in insertion and deletion? 1. O(n) to O(logn) where n is number of elements 2. O(n) to O(1) where n is number of elements 3. no change 4. O(n) to O(n2) where n is number of elements Answer :   1 - O(n) to O(logn) where n is number of elements