Delete the node with value X of a Linked List

Introduction

Linked lists are fundamental data structures in computer science, providing an efficient way to organize and manipulate data. One common operation when working with linked lists is deleting a node with a specific value. In this blog, we’ll explore the process of Delete the node with value X of a Linked List, breaking down the steps with simple language and examples.

Understanding Linked Lists

Before diving into the deletion process, let’s briefly review what linked lists are. A linked list is a collection of nodes, where each node contains data and a reference (or link) to the next node in the sequence. The last node typically points to null, indicating the end of the list.

Example: Consider a simple singly linked list:

1 -> 3 -> 7 -> 2 -> 8 -> null

Here, each number represents a node, and the arrows represent links between them.

The Challenge: Deleting a Node with Value X

Now, let’s focus on the task at hand: deleting a node with a specific value, X, from the linked list.

Example: Suppose we want to delete the node with the value 2 from the linked list:

1 -> 3 -> 7 -> 2 -> 8 -> null

Approach to Deleting a Node

• Traverse the Linked List: To delete a node, we must first locate it in the linked list. This involves traversing the list until we find the node with the desired value.

• 2. Update the Links: Once we find the node to be deleted, we need to update the links to bypass that node. This effectively removes the node from the list.

Example

Let’s apply these steps to the linked list we’ve been using:

1 -> 3 -> 7 -> 2 -> 8 -> null

Step 1: Traverse the Linked List

Starting from the head of the list (the first node), we iterate through the nodes until we find the node with the value 2.

Step 2: Update the Links

Once we find the node with the value 2, we update the links to bypass it:

1 -> 3 -> 7 ------> 8 -> null

Implementation in Code

Let’s convert our approach into a simple code snippet in a common programming language like Python.

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

def delete_node(head, value_to_delete):
    # Initialize pointers
    current = head
    previous = None

    # Traverse the linked list
    while current is not None and current.data != value_to_delete:
        previous = current
        current = current.next

    # Node with value_to_delete not found
    if current is None:
        print("Node with value {} not found.".format(value_to_delete))
        return head

    # Update the links to bypass the node
    if previous is None:
        # If the node to be deleted is the head
        head = current.next
    else:
        # If the node to be deleted is not the head
        previous.next = current.next

    return head

Example Usage

Let’s use the code snippet to delete the node with the value 2 from our linked list:

# Create the linked list
head = Node(1)
head.next = Node(3)
head.next.next = Node(7)
head.next.next.next = Node(2)
head.next.next.next.next = Node(8)

# Print the original linked list
print("Original Linked List:")
current = head
while current is not None:
    print(current.data, end=" -> ")
    current = current.next
print("null")

# Delete the node with value 2
head = delete_node(head, 2)

# Print the updated linked list
print("\nLinked List after Deletion:")
current = head
while current is not None:
    print(current.data, end=" -> ")
    current = current.next
print("null")

Conclusion

In this blog, we’ve explored the process of deleting a node with a specific value from a linked list. We started by understanding the basics of linked lists and then delved into the step-by-step approach for Delete the node with value X of a Linked List. Through simple language and examples, we clarified the traversal and link updating steps. Additionally, we provided a basic implementation in Python for readers to experiment with.

Mastering linked list operations like node deletion is crucial for building a strong foundation in data structures and algorithms. By breaking down the concepts into manageable steps, we hope to make this fundamental operation more accessible to learners and enthusiasts alike.

Read More –

Insert Before Node with Value X in a Linked List: A Step-by-Step Guide – https://kamleshsingad.com/insert-before-node-with-value-x-in-a-linked-list-a-step-by-step-guide/

Inserting Before the Kth Element in a Linked List – https://kamleshsingad.com/inserting-before-the-kth-element-in-a-linked-list/

Insert at the head of a Linked List – https://kamleshsingad.com/insert-at-the-head-of-a-linked-list/