Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by harsh526
25.2k
views
5
votes
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 del...
25.2k
views
answered
Jul 6, 2017
DS
gateit-2004
data-structures
linked-list
normal
ambiguous
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register