Q84
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
AnswerB.
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: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board