How do I perform operations on a linked list in C++?

How do I perform operations on a linked list in C++?

You can perform various operations like insertion, deletion, and traversal on a linked list in C++. Would you like to see examples?

Yes, please show me how to insert a node at the beginning.

To insert a node at the beginning, you create a new node, set its next pointer to the current head, and then update the head to this new node. Here's a sample code snippet:

struct Node {
    int data;
    Node* next;
};

void insertAtBeginning(Node*& head, int newData) {
    Node* newNode = new Node();
    newNode->data = newData;
    newNode->next = head;
    head = newNode;
}

What about deleting a node?

To delete a node, you need to find the node, adjust the pointers, and free the memory. Here's how you can do it:

void deleteNode(Node*& head, int key) {
    Node* temp = head;
    Node* prev = nullptr;
    if (temp != nullptr && temp->data == key) {
        head = temp->next;
        delete temp;
        return;
    }
    while (temp != nullptr && temp->data != key) {
        prev = temp;
        temp = temp->next;
    }
    if (temp == nullptr) return;
    prev->next = temp->next;
    delete temp;
}