This post is completed by 1 user Login To Mark Completed

0

Add to List Add To List..(Max 5) Close Save

Beginner

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

Run This Code

Code:

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

---

---

Also Read:

- Delete X Nodes After Y Nodes In a Linked List Beginner
- Reverse Alternative 'k' nodes in a Linked List. Medium
- Merge or Combine Two Sorted Linked Lists Medium
- Doubly Linked List Complete Implementation Beginner
- Reverse a Linked List in groups of given size 'K' Medium
- Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree. Medium
- Merge a Linked list into another Linked List at Alternate Positions. Medium

---