1 votes 1 votes closed as a duplicate of: GATE IT 2004 | Question: 13 Let P be a single linked list.Let Q be a pointer to an intermediate node 'X' in the list.What is the worst case time complexity of best known algorithm to delete the node 'X ' from the list Programming in C linked-list algorithms data-structures + – saipriyab asked Nov 25, 2017 • recategorized Jul 6, 2022 by Lakshman Bhaiya saipriyab 1.4k views comment Share Follow See all 11 Comments See all 11 11 Comments reply Show 8 previous comments Ashwin Kulkarni commented Nov 25, 2017 reply Follow Share @abhishek Here content of node to which Q is pointing already changed. Hence to need to again point prev of Q to next of Q. 0 votes 0 votes abhishek tiwary commented Nov 25, 2017 reply Follow Share we need another pointer who will point to previous node of Q P->next=Q; then again A will point to C A->C->D... but for this question we do not have to do @ Manu Thakur sir ?? 0 votes 0 votes Manu Thakur commented Nov 25, 2017 reply Follow Share @abhishek why do you need a pointer the the previous node of the node pointedby q? it is written in the question node to be deleted is an intermediate node. if question is to delete the last node then we need a pointer which will point to the second last node. hence to delete last TC is O(n) and other than last node each node can be deleted in O(1) 2 votes 2 votes Please log in or register to add a comment.