Delete a Node in the Middle of a linked list, Given only access to that 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

Input: A Linked List and access to the node which needs to be deleted

Output: Linked list with deleted node

Approach:

  • Approach is tricky and simple
  • Copy the value of next node to the node which you want to delete
  • Delete the next node

Delete a Node in the Middle of a linked list, Given only access to that Node

Complete Code:

Output:

Original List : ->1->2->8->3->7->0->4
Aftter Deleting the mid node (say 7) : ->1->2->8->3->0->4

Leave a Comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.