What is the time complexity of deleting a node from the middle of a singly linked list given a pointer to that node?

Question

Accepted Answer

(B) O(n). Explanation: You must traverse from head to find the previous node to update its next pointer — O(n).