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

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

To delete a node from a circular linked list, you need to adjust the pointers of the nodes accordingly. Can you provide the node value you want to delete?

I want to delete the node with the value 5.

First, traverse the list to find the node with value 5. Once found, adjust the previous node's next pointer to skip the node with value 5.

What if the node to delete is the head node?

If the head node is to be deleted, you need to find the last node to update its next pointer to the new head. Then, set the head to the next node.

Can you show me a code example?

Sure! Here's a simple code snippet:

void deleteNode(Node*& head, int value) {
    if (!head) return;
    Node* current = head;
    Node* prev = nullptr;
    do {
        if (current->data == value) {
            if (prev) {
                prev->next = current->next;
            } else {
                // Handle head deletion
                Node* last = head;
                while (last->next != head) last = last->next;
                last->next = head->next;
                head = head->next;
            }
            delete current;
            return;
        }
        prev = current;
        current = current->next;
    } while (current != head);
}