The Gateway to Computer Science Excellence
0 votes

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 n)

C) O(log n)

D) O(1)

closed as a duplicate of: GATE2004-IT-13
in DS by Boss (11k points)
closed by | 88 views

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,292 answers
104,919 users