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
What is the time complexity improvement of skip lists from linked lists in insertion and deletion?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
What is the time complexity improvement of skip lists from linked lists in insertion and deletion?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!