0 votes 0 votes closed as a duplicate of: GATE IT 2004 | Question: 13 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) DS linked-list + – Sankaranarayanan P.N asked Oct 27, 2016 • closed Oct 27, 2016 by Kapil Sankaranarayanan P.N 371 views comment Share Follow See all 0 reply Please log in or register to add a comment.