Skip to content
Related Articles

Related Articles

UGC-NET | UGC NET CS 2018 Dec – II | Question 57
  • Last Updated : 16 Sep, 2020

Consider the singly linked list. What is the worst case time complexity of the best-known algorithm to delete the node a, pointer to this node is q, from the list ?
(A) O(1)
(B) O(lg n)
(C) O(n)
(D) O(n lg n)


Answer: (C)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Recommended Articles
Page :