Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?
October 28, 2007 · Filed Under C Interview Questions, Placement Questions
 Don't want to miss a single bit? Subscribe By Email for Daily Jobs |
This is a very good interview question
The solution to this is to copy the data from the next node into this node and delete the next node!. Ofcourse this wont work if the node to be deleted is the last node. Mark it as dummy in that case. If you have a Circular linked list, then this might be all the more interesting. Try writing your own C program to solve this problem. Having a doubly linked list is always better.
Related Articles
- Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?
- How would you detect a loop in a linked list? Write a C program to detect a loop in a linked list.How would you detect a loop in a linked list? Write a C program to detect a loop in a linked list.
- How would you detect a loop in a linked list? Write a C program to detect a loop in a linked list.
- How would you detect a loop in a linked list? Write a C program to detect a loop in a linked list.
- How to create a copy of a linked list? Write a C program to create a copy of a linked list.
-
Subscribe
-
Job In Companies
-
Latest Jobs- TCS Freshers Walkin Banking Jobs - TCS BPO
- Sutherland Freshers Walkin
- Syntel Freshers Walkin
- Citigroup Freshers Walkin Jan 6 - 7
- NVIDIA Corp Recruits Freshers Senior Hardware Engineer
- BA Continuum Sol Recruits Freshers Tech Associate
- Convergys Recruits Freshers Technician - Network Services
- Bose Recruits Freshers TECHNICIAN
- RR Donnelley Recruits Freshers Customer Service Executive
- Zensar Tech Recruits Freshers Customer Service Executives