Programming-for-Output-Problems
September 30, 2023ISRO-2016
September 30, 2023Data-Structures
|
Question 1
|
Let P be a singly linked list. Let Q be the pointer to an intermediate node x in the list. What is the worst-case time complexity of the best known algorithm to delete the node x from the list?
|
O(n)
|
|
|
O(log2 n)
|
|
|
O(logn)
|
|
|
O(1)
|
Question 1 Explanation:
Worst case complexity for deleting a node from singly linked list is O(1).
Correct Answer: D
Question 1 Explanation:
Worst case complexity for deleting a node from singly linked list is O(1).
Subscribe
Login
0 Comments