Sail E0 Webinar
Question
What is the time complexity improvement of skip lists from linked lists in insertion and deletion?
Options:
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: Option A





Submit Your Solution Below and Earn Points !
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

Latest Videos

Latest Test Papers