|
This post is completed by 1 user
|
Add to List |
29. Delete a Node in the Middle of a Linked List Without Access to Head Node
Objective: Write a program to Delete a Node in the Middle of a linked list, Given only access to that Node
Example:
Original List : ->1->2->8->3->7->0->4 After Deleting the mid node (say 7) : ->1->2->8->3->0->4
Approach:
- Approach is tricky and simple
- Copy the value of next node to the node which you want to delete
- Delete the next node
Output:
Original List : ->1->2->8->3->7->0->4 Aftter Deleting the mid node (say 7) : ->1->2->8->3->0->4