# C - Delete all nodes by key of the Circular Doubly Linked List

In this method, all nodes in the circular doubly linked list with specified key (value) is deleted. For example - if the given list is 10->20->30->10->20 and all occurrences of 20 are deleted, the list becomes 10->30->10.

If the head of the circular doubly linked list is not null and the value stored at head is equal to key, then adjust the head as head next, delete previous head and adjust links. Keep on doing the same process until the new head becomes null or not equal to the key. After that create a temp node to traverse through the list and delete those nodes with value equal to the key and adjust links accordingly.

The function *pop_all* is created for this purpose. It is a **2-step process**.

void pop_all(struct Node** head_ref, int key) { struct Node* nodeToDelete; struct Node* temp; //1. if the head is not null and value stored at // head is equal to key, keep on adjusting the // head as head next and deleting previous head // until new head becomes null or not equal to key while(*head_ref != NULL && (*head_ref)->data == key) { if((*head_ref)->next == *head_ref) { *head_ref = NULL; } else { nodeToDelete = *head_ref; temp = *head_ref; // traverse to the last element of // the list to adjust links while(temp->next != *head_ref) { temp = temp->next; } *head_ref = (*head_ref)->next; temp->next = *head_ref; (*head_ref)->prev = temp; free(nodeToDelete); } } //2. create a temp node to traverse through the // list and delete nodes with value equal to // key and adjust links accordingly temp = *head_ref; if(temp != NULL) { while(temp->next != *head_ref) { if(temp->next->data == key) { nodeToDelete = temp->next; temp->next = temp->next->next; temp->next->prev = temp; free(nodeToDelete); } else { temp = temp->next; } } } }

The below is a complete program that uses above discussed concept to delete all occurrences of the specified key (if exists) of the circular doubly linked list.

#include <stdio.h> #include <stdlib.h> //node structure struct Node { int data; struct Node* next; struct Node* prev; }; //Add new element at the end of the list void push_back(struct Node** head_ref, int newElement) { struct Node *newNode, *temp; newNode = (struct Node*)malloc(sizeof(struct Node)); newNode->data = newElement; newNode->next = NULL; newNode->prev = NULL; if(*head_ref == NULL) { *head_ref = newNode; newNode->next = *head_ref; newNode->prev = *head_ref; } else { temp = *head_ref; while(temp->next != *head_ref) { temp = temp->next; } temp->next = newNode; newNode->next = *head_ref; newNode->prev = temp; (*head_ref)->prev = newNode; } } //Delete all nodes by key void pop_all(struct Node** head_ref, int key) { struct Node* nodeToDelete; struct Node* temp; while(*head_ref != NULL && (*head_ref)->data == key) { if((*head_ref)->next == *head_ref) { *head_ref = NULL; } else { nodeToDelete = *head_ref; temp = *head_ref; while(temp->next != *head_ref) { temp = temp->next; } *head_ref = (*head_ref)->next; temp->next = *head_ref; (*head_ref)->prev = temp; free(nodeToDelete); } } temp = *head_ref; if(temp != NULL) { while(temp->next != *head_ref) { if(temp->next->data == key) { nodeToDelete = temp->next; temp->next = temp->next->next; temp->next->prev = temp; free(nodeToDelete); } else { temp = temp->next; } } } } //display the content of the list void PrintList(struct Node* head_ref) { struct Node* temp = head_ref; if(head_ref != NULL) { printf("The list contains: "); while (1) { printf("%i ",temp->data); temp = temp->next; if(temp == head_ref) break; } printf("\n"); } else { printf("The list is empty.\n"); } } // test the code int main() { struct Node* MyList = NULL; //Add five elements at the end of the list. push_back(&MyList, 10); push_back(&MyList, 20); push_back(&MyList, 30); push_back(&MyList, 10); push_back(&MyList, 20); PrintList(MyList); //Delete all occurrences of 20 pop_all(&MyList, 20); PrintList(MyList); return 0; }

The above code will give the following output:

The list contains: 10 20 30 10 20 The list contains: 10 30 10