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)
3660 Points
2580 Points
2040 Points
1966 Points
1768 Points
1614 Points
1610 Points
1492 Points
1472 Points
1464 Points
Gatecse
Step 0: Study the topic/subject. Use Bikram ...