1.

What is the time complexity improvement of skip lists from linked lists in insertion and deletion?

A. O(n) to O(logn) where n is number of elements
B. O(n) to O(1) where n is number of elements
C. no change
D. O(n) to O(n2) where n is number of elements
Answer» B. O(n) to O(1) where n is number of elements


Discussion

No Comment Found

Related MCQs