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 node X from the list?
A) O(n)
B) O(log ^{2 }n)
C) O(log n)
D) O(1)
3302 Points
1776 Points
1646 Points
1640 Points
1396 Points
1272 Points
1142 Points
1044 Points
1000 Points
754 Points
732 Points
402 Points
304 Points
238 Points
Gatecse
Why difficult?