What is the time complexity improvement of skip lists from linked lists in insertion and deletion? - Study24x7
Social learning Network
01 Apr 2019 10:21 AM study24x7 study24x7

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

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles