How do I delete a node from a linked list in C++?

How do I delete a node from a linked list in C++?

To delete a node from a linked list in C++, you need to adjust the pointers. Can you provide the structure of your linked list?

Sure! Here's my node structure: struct Node { int data; Node* next; };

Great! To delete a node, you need to find the node to delete and adjust the previous node's next pointer. Do you have a specific node value in mind?

Yes, I want to delete the node with the value 3.

You can traverse the list, find the node with value 3, and then adjust the pointers. Here's a sample code snippet:

void deleteNode(Node** head_ref, int key) {
    Node* temp = *head_ref, *prev = nullptr;
    if (temp != nullptr && temp->data == key) {
        *head_ref = temp->next; // Change head
        delete temp; // Free old head
        return;
    }
    while (temp != nullptr && temp->data != key) {
        prev = temp;
        temp = temp->next;
    }
    if (temp == nullptr) return; // Key not found
    prev->next = temp->next;
    delete temp;
}

Would you like to know more about linked lists?