Given a arbitrary pointer to an element in a singly linked
list?what is the time complexity for its deletion .



Given a arbitrary pointer to an element in a singly linked list?what is the time complexity for it..

Answer / guest

O(n)

Is This Answer Correct ?    1 Yes 0 No

Post New Answer

More Programming Languages AllOther Interview Questions

what are partial classes. Where is the entry point of partial classes.

1 Answers   Satyam,


Given: coordinates of rectangle-> left bottom and right top points. the rectangles create a hole.Find the maximum area of the hole. eg. 4 rectangles create a hole in between. find its area.

0 Answers   Manhattan,


Find out the list of roles which gives access to GUI activities? thanks in advance

0 Answers  


Hi guyes, I have cleared 2 technical rounds with cts for liferay and java techonologies, i have client round next week, please tell me how to prepare for this what questions i should be ready to face?

0 Answers  


in a company 30% are supervisors and 40% employees are male if 60% of supervisors are male. what is the probability that a randomly choosen employee is a male or female?need steps to solve this?

1 Answers   TCS,


hi, all this is shoba m.c.a . i have learned abap but no oppurtunities right now as fresher , right now i want to learn any course on demand any one pls suggest me good course and institute in hyderabad

0 Answers  


1.what is the vesition managment.

0 Answers   IBM,


I want sample papers for NIC Examination. Plz send them to my mail Id das.neelam@gmail.com . Plz send it today, tomorrow i've the exam.

0 Answers  


what type of exceptions & problems are faced in production time at java technology?

0 Answers   CTS,


what is difference between java and c#

2 Answers   Cyient,


there are N number of matchboxes numbered 1...N.each matchbox contain various number of stick.Two player can alternatevely pick some amount of stick from the higest stick containing box . The player is condidered win if there is no stick after his move.Find the final move so that the move player win. Note:In case the number of stick is equal ,pick the stick from the higest numbered box. eg: 3 box contain stick as:1,1,1. if u take 1 stick from 3rd numbred box you will any how win the match.

0 Answers   Manhattan,


What are data structures?

1 Answers  


Categories