Delete smaller nodes in linked list program in Java

// Java Program // Delete N nodes of after the M nodes set B class Node { public int data; public Node next; public Node[int value] { this.data = value; this.next = null; } } public class LinkedList { public Node head; // Class constructors public LinkedList[] { head = null; } // Insert new node at the last public void insert[int value] { // Create new node Node node = new Node[value]; if [head == null] head = node; else { Node temp = head; // find last node while [temp.next != null] { // visit to next node temp = temp.next; } // add node temp.next = node; } } // Display all Linked List elements public void display[] { if [this.head != null] { System.out.print["Linked List Element :"]; Node temp = head; while [temp != null] { System.out.print[" " + temp.data]; temp = temp.next; } } else { System.out.println["Empty Linked list"]; } } public void deleteNode[int m, int n] { if [this.head == null] { System.out.println["Empty Linked List"]; } else if [m next = nullptr; } }; class LinkedList { public: Node *head; // Class constructors LinkedList[] { this->head = nullptr; } // Insert new node at the last void insert[int value] { // Create new node Node *node = new Node[value]; if [this->head == nullptr] { this->head = node; } else { Node *temp = this->head; // find last node while [temp->next != nullptr] { // visit to next node temp = temp->next; } // add node temp->next = node; } } // Display all Linked List elements void display[] { if [this->head != nullptr] { cout head; while [temp != nullptr] { cout next; } } else { cout next; hold->next = current->next; current = nullptr; } count++; if [count == n] { //reset the value count = 0; find = 0; } } } } } }; int main[] { int m = 2; int n = 3; LinkedList *task = new LinkedList[]; task->insert[1]; task->insert[2]; task->insert[3]; task->insert[4]; task->insert[5]; task->insert[6]; task->insert[7]; task->insert[8]; task->insert[9]; cout next; // location is to find delete node if [hold->next != NULL] { // when delete node is found current = hold->next; hold->next = current->next; free[current]; current = NULL; } count++; if [count == N] { // reset the value of find and count nodes count = 0; find = 0; } } } } } int main[] { // Create node pointer struct Node *head = NULL; int m = 2, n = 3; // Insert element of linked list insert[ &head, 1]; insert[ &head, 2]; insert[ &head, 3]; insert[ &head, 4]; insert[ &head, 5]; insert[ &head, 6]; insert[ &head, 7]; insert[ &head, 8]; insert[ &head, 9]; printf["Linked List :"]; // Display all node display[head]; printf["\n M = %d N = %d", m, n]; printf["\nAfter Remove Linked List : "]; delete_node[head, m, n]; display[head]; }

Output

Linked List :1 2 3 4 5 6 7 8 9 M = 2 N = 3 After Remove Linked List : 1 2 6 7 8 9

// Include namespace system using System; // Csharp Program // Delete N nodes of after the M nodes set B public class Node { public int data; public Node next; public Node[int value] { this.data = value; this.next = null; } } public class LinkedList { public Node head; // Class constructors public LinkedList[] { this.head = null; } // Insert new node at the last public void insert[int value] { // Create new node var node = new Node[value]; if [this.head == null] { this.head = node; } else { var temp = this.head; // find last node while [temp.next != null] { // visit to next node temp = temp.next; } // add node temp.next = node; } } // Display all Linked List elements public void display[] { if [this.head != null] { Console.Write["Linked List Element :"]; var temp = this.head; while [temp != null] { Console.Write[" " + temp.data.ToString[]]; temp = temp.next; } } else { Console.WriteLine["Empty Linked list"]; } } public void deleteNode[int m, int n] { if [this.head == null] { Console.WriteLine["Empty Linked List"]; } else if [m