What is the time complexity improvement of skip lists from linked lists in insertion and deletion?
Posted: Wed Jul 13, 2022 7:42 pm
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
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