# Delete all the nodes from the list which are divisible by any given number K

Given a Linked List and a key K. The task is to write a program to delete all the nodes from the list that are divisible by K.

**Examples:**

Input :12->15->9->11->5->6->7 K = 3Output :11 -> 5 -> 7Input :13->4->16->9->22->45->5->16->6 K = 4Output :13 -> 9 -> 22 -> 45 -> 5 -> 6

The approach to solving this problem is similar to deleting all nodes from the list which are lesser than the given key.

**There are two possible cases:**

- Head node holds a value divisible by K: First check for all occurrences at head node which are divisible by K, delete them and change the head node appropriately.
- Some intermediate node holds value divisible by k: Start traversing from head and check if current node’s value is divisible by K. If yes then delete that node and move forward in the list.

Below is the implementation of the above approach:

`// C++ program to delete all the nodes from the list ` `// that are divisible by the specified value K ` `#include <bits/stdc++.h> ` ` ` `using` `namespace` `std; ` ` ` `// Tree Node ` `struct` `Node { ` ` ` `int` `data; ` ` ` `Node* next; ` `}; ` ` ` `// Function to create a new node ` `Node* getNode(` `int` `data) ` `{ ` ` ` `Node* newNode = ` `new` `Node; ` ` ` `newNode->data = data; ` ` ` `newNode->next = NULL; ` ` ` `return` `newNode; ` `} ` ` ` `// Function to delete all the nodes from the list ` `// that divisible by the specified value K ` `void` `deleteDivisibleNodes(Node** head_ref, ` `int` `K) ` `{ ` ` ` `Node *temp = *head_ref, *prev; ` ` ` ` ` `// If head node itself holds the value divisible by K ` ` ` `while` `(temp != NULL && temp->data % K == 0) { ` ` ` `*head_ref = temp->next; ` `// Changed head ` ` ` `free` `(temp); ` `// free old head ` ` ` `temp = *head_ref; ` `// Change temp ` ` ` `} ` ` ` ` ` `// Delete occurrences other than head ` ` ` `while` `(temp != NULL) { ` ` ` ` ` `// Search for the node to be deleted, ` ` ` `// keep track of the previous node as we ` ` ` `// need to change 'prev->next' ` ` ` `while` `(temp != NULL && temp->data % K != 0) { ` ` ` `prev = temp; ` ` ` `temp = temp->next; ` ` ` `} ` ` ` ` ` `// If required value node was not present ` ` ` `// in linked list ` ` ` `if` `(temp == NULL) ` ` ` `return` `; ` ` ` ` ` `// Unlink the node from linked list ` ` ` `prev->next = temp->next; ` ` ` ` ` `delete` `temp; ` `// Free memory ` ` ` ` ` `// Update Temp for next iteration of ` ` ` `// outer loop ` ` ` `temp = prev->next; ` ` ` `} ` `} ` ` ` `// function to a print a linked list ` `void` `printList(Node* head) ` `{ ` ` ` `while` `(head) { ` ` ` `cout << head->data << ` `" "` `; ` ` ` `head = head->next; ` ` ` `} ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `// Create list: 12->15->9->11->5->6->7 ` ` ` `Node* head = getNode(12); ` ` ` `head->next = getNode(15); ` ` ` `head->next->next = getNode(9); ` ` ` `head->next->next->next = getNode(11); ` ` ` `head->next->next->next->next = getNode(5); ` ` ` `head->next->next->next->next->next = getNode(6); ` ` ` `head->next->next->next->next->next->next = getNode(7); ` ` ` `int` `K = 3; ` ` ` ` ` `cout << ` `"Initial List: "` `; ` ` ` `printList(head); ` ` ` ` ` `deleteDivisibleNodes(&head, K); ` ` ` ` ` `cout << ` `"\nFinal List: "` `; ` ` ` `printList(head); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

**Output:**

Initial List: 12 15 9 11 5 6 7 Final List: 11 5 7

## Recommended Posts:

- Delete all nodes from the doubly linked list which are divisible by K
- Sum of all nodes in a doubly linked list divisible by a given number K
- Product of all nodes in a doubly linked list divisible by a given number K
- Delete N nodes after M nodes of a linked list
- Delete all the nodes from the list which are less than K
- Delete all the nodes from the list that are greater than x
- Delete all the even nodes of a Circular Linked List
- Delete alternate nodes of a Linked List
- Delete all the even nodes from a Doubly Linked List
- Delete all odd or even positioned nodes from Circular Linked List
- Delete all Prime Nodes from a Doubly Linked List
- Delete all the nodes from a doubly linked list that are smaller than a given value
- Delete all the nodes from the doubly linked list that are greater than a given value
- Delete all Non-Prime Nodes from a Singly Linked List
- Delete all Prime Nodes from a Singly Linked List

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.