Sail E0 Webinar
Question
What is the time complexity to delete an element from the direct address table?
Options:
A .  O(n)
B .  O(logn)
C .  O(nlogn)
D .  O(1)
Answer: Option D


As every key has a unique array position, it takes constant time to delete an element, although the deleted position must be specified by nil.



Was this answer helpful ?
Next Question

Submit Solution

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

Latest Videos

Latest Test Papers