CSharp  Java  Python  Swift  GO  WPF  Ruby  Scala  F#  JavaScript  SQL  PHP  Angular  HTML
Q. Program to insert a new node at the middle of the circular linked list.ExplanationIn this program, we create a circular linked list and insert a new node in the middle of the list. If the list is empty, both head and tail will point to new node. If the list is not empty, then we will calculate the size of the list and divide it by 2 to get the midpoint of the list where the new node needs to be inserted. After inserting the new node in the middle of the list. Consider the above diagram; the new node needs to be added to the middle of the list. First, we calculate the size which in this case is 4. So, to get the midpoint, we divide it by 2 and store it in a variable count. We will define two nodes current, and temp such that temp will point to head, and current will point to the node previous to temp. We iterate through the list till midpoint is reached by incrementing temp to temp.next then, insert the new node in between current and temp. Current'next node will be new and the new's next node will be temp. Algorithm
SolutionPython#Represents the node of list. class Node: def __init__(self,data): self.data = data; self.next = None; class CreateList: #Declaring head and tail pointer as null. def __init__(self): self.head = Node(None); self.tail = Node(None); self.head.next = self.tail; self.tail.next = self.head; self.size = 0; #This function will add the new node to the list. def add(self,data): newNode = Node(data); #Checks if the list is empty. if self.head.data is None: #If list is empty, both head and tail would point to new node. self.head = newNode; self.tail = newNode; newNode.next = self.head; else: #tail will point to new node. self.tail.next = newNode; #New node will become new tail. self.tail = newNode; #Since, it is circular linked list tail will points to head. self.tail.next = self.head; #Size will count the number of element in the list self.size = self.size+1; #This function will add the new node at the middle of the list. def addInMid(self,data): newNode = Node(data); #Checks if the list is empty. if(self.head == None): #If list is empty, both head and tail would point to new node. self.head = newNode; self.tail = newNode; newNode.next = self.head; else: #Store the midpoint of the list count = (self.size//2) if (self.size % 2 == 0) else ((self.size+1)//2); #temp will point to head temp = self.head; for i in range(0,count): #Current will point to node previous to temp. current = temp; #Traverse through the list till the middle of the list is reached temp = temp.next; #current will point to new node current.next = newNode; #new node will point to temp newNode.next = temp; self.size = self.size+1; #Displays all the nodes in the list def display(self): current = self.head; if self.head is None: print("List is empty"); return; else: #Prints each node by incrementing pointer. print(current.data), while(current.next != self.head): current = current.next; print(current.data), class CircularLinkedList: cl = CreateList(); #Adds data to the list cl.add(1); cl.add(2); cl.add(3); cl.add(4); print("Original list: "); cl.display(); #Inserting node '5' in the middle cl.addInMid(5); print("\nUpdated List: "); cl.display(); #Inserting node '6' in the middle cl.addInMid(6); print("\nUpdated List: "); cl.display(); Output: Original list: 1 2 3 4 Updated List: 1 2 5 3 4 Updated List: 1 2 5 6 3 4 C#include <stdio.h> #include <string.h> #include <stdlib.h> //Represents the node of list. struct node{ int data; struct node *next; }; //Declaring head and tail pointer as null. struct node *head = NULL; struct node *tail = NULL; int size = 0; //This function will add the new node to the list. void add(int data){ //Create new node struct node *newNode = (struct node*)malloc(sizeof(struct node)); newNode>data = data; //Checks if the list is empty. if(head == NULL){ //If list is empty, both head and tail would point to new node. head = newNode; tail = newNode; newNode>next = head; }else { //tail will point to new node. tail>next = newNode; //New node will become new tail. tail = newNode; //Since, it is circular linked list tail will point to head. tail>next = head; } size++; } //This function will add the new node at the middle of the list. void addInMid(int data){ int i; struct node *newNode = (struct node*)malloc(sizeof(struct node)); newNode>data = data; //Checks if the list is empty. if(head == NULL){ //If list is empty, both head and tail would point to new node. head = newNode; tail = newNode; newNode>next = head; } else{ struct node *temp, *current = NULL; //Store the midpoint of the list int count = (size % 2 == 0) ? (size/2) : ((size+1)/2); //temp will point to head temp = head; for(i = 0; i < count; i++){ //Current will point to node previous to temp. current = temp; //Traverse through the list till the middle of the list is reached temp = temp>next; } //current will point to new node current>next = newNode; //new node will point to temp newNode>next = temp; } size++; } //This function will display the nodes of circular linked list void display(){ struct node *current = head; if(head == NULL){ printf("List is empty"); } else{ do{ //Prints each node by incrementing pointer. printf("%d ", current>data); current = current>next; }while(current != head); printf("\n"); } } int main() { //Adds data to the list add(1); add(2); add(3); add(4); printf("Original list:\n "); display(); //Inserting node '5' in the middle addInMid(5); printf("Updated List:\n "); display(); //Inserting node '6' in the middle addInMid(6); printf("Updated List:\n "); display(); return 0; } Output: Original list: 1 2 3 4 Updated List: 1 2 5 3 4 Updated List: 1 2 5 6 3 4 JAVApublic class InsertInMid { //Represents the node of list. public class Node{ int data; Node next; public Node(int data) { this.data = data; } } public int size; //Declaring head and tail pointer as null. public Node head = null; public Node tail = null; //This function will add the new node to the list. public void add(int data){ //Create new node Node newNode = new Node(data); //Checks if the list is empty. if(head == null) { //If list is empty, both head and tail would point to new node. head = newNode; tail = newNode; newNode.next = head; } else { //tail will point to new node. tail.next = newNode; //New node will become new tail. tail = newNode; //Since, it is circular linked list tail will points to head. tail.next = head; } //Size will count the number of element in the list size++; } //This function will add the new node at the middle of the list. public void addInMid(int data){ Node newNode = new Node(data); //Checks if the list is empty. if(head == null){ //If list is empty, both head and tail would point to new node. head = newNode; tail = newNode; newNode.next = head; } else{ Node temp,current; //Store the midpoint of the list int count = (size % 2 == 0) ? (size/2) : ((size+1)/2); //temp will point to head temp = head; current= null; for(int i = 0; i < count; i++){ //Current will point to node previous to temp. current = temp; //Traverse through the list till the middle of the list is reached temp = temp.next; } //current will point to new node current.next = newNode; //new node will point to temp newNode.next = temp; } size++; } //Displays all the nodes in the list public void display() { Node current = head; if(head == null) { System.out.println("List is empty"); } else { do{ //Prints each node by incrementing pointer. System.out.print(" "+ current.data); current = current.next; }while(current != head); System.out.println(); } } public static void main(String[] args) { InsertInMid cl = new InsertInMid(); //Adds data to the list cl.add(1); cl.add(2); cl.add(3); cl.add(4); System.out.println("Original list: "); cl.display(); //Inserting node '5' in the middle cl.addInMid(5); System.out.println( "Updated List: "); cl.display(); //Inserting node '6' in the middle cl.addInMid(6); System.out.println("Updated List: "); cl.display(); } } Output: Original list: 1 2 3 4 Updated List: 1 2 5 3 4 Updated List: 1 2 5 6 3 4 C#using System; namespace CircularLinkedList { public class Program { //Represents the node of list. public class Node<T>{ public T data; public Node<T> next; public Node(T value) { data = value; next = null; } } public class CreateList<T>{ protected Node<T> head = null; protected Node<T> tail = null; int size = 0; //This function will add the new node to the list. public void add(T data){ //Create new node Node<T> newNode = new Node<T>(data); //Checks if the list is empty. if(head == null){ head = newNode; tail = newNode; newNode.next = head; }else{ //tail will point to new node. tail.next = newNode; //New node will become new tail. tail = newNode; //Since, it is circular linked list tail will points to head. tail.next = head; } size++; } //This function will add the new node at the middle of the list. public void addInMid(T data){ Node<T> newNode = new Node<T>(data); //Checks if the list is empty. if(head == null){ //If list is empty, both head and tail would point to new node. head = newNode; tail = newNode; newNode.next = head; } else{ Node<T> temp,current; //Store the midpoint of the list int count = (size % 2 == 0) ? (size/2) : ((size+1)/2); //temp will point to head temp = head; current= null; for(int i = 0; i < count; i++){ //Current will point to node previous to temp. current = temp; //Traverse through the list till the middle of the list is reached temp = temp.next; } //current will point to new node current.next = newNode; //new node will point to temp newNode.next = temp; } size++; } //Displays all the nodes in the list public void display(){ Node<T> current = head; if(head == null){ Console.WriteLine("List is empty"); } else{ do{ //Prints each node by incrementing pointer. Console.Write(" "+ current.data); current = current.next; }while(current != head); } } } public static void Main() { CreateList<int> cl = new CreateList<int>(); //Adds data to the list cl.add(1); cl.add(2); cl.add(3); cl.add(4); Console.WriteLine("Original list: "); cl.display(); //Inserting node '5' in the middle cl.addInMid(5); Console.WriteLine(); Console.WriteLine("Updated List: "); cl.display(); //Inserting node '6' in the middle cl.addInMid(6); Console.WriteLine(); Console.WriteLine("Updated List: "); cl.display(); } } } Output: Original list: 1 2 3 4 Updated List: 1 2 5 3 4 Updated List: 1 2 5 6 3 4 PHP<!DOCTYPE html> <html> <body> <?php //Represents the node of list. class Node{ public $data; public $next; function __construct($data){ $this>data = $data; $this>next = NULL; } } class CreateList{ //Declaring head and tail pointer as null. private $head; private $tail; private $size; function __construct(){ $this>head = NULL; $this>tail = NULL; $this>size = 0; } //This function will add the new node to the list. function add($data){ //Create new node $newNode = new Node($data); //Checks if the list is empty. if($this>head == NULL){ //If list is empty, both head and tail would point to new node. $this>head = $newNode; $this>tail = $newNode; $newNode>next = $this>head; } else{ //tail will point to new node. $this>tail>next = $newNode; //New node will become new tail. $this>tail = $newNode; //Since, it is circular linked list tail will point to head. $this>tail>next = $this>head; } $this>size++; } //This function will add the new node at the middle of the list. function addInMid($data){ $newNode = new Node($data); //Checks if the list is empty. if($this>head == NULL){ //If list is empty, both head and tail would point to new node. $this>head = $newNode; $this>tail = $newNode; $newNode>next = $this>head; } else{ //Store the midpoint of the list $count = ($this>size % 2 == 0) ? ($this>size/2):(($this>size+1)/2); //temp will point to head $temp = $this>head; for($i = 0; $i < $count; $i++){ //Current will point to node previous to temp. $current = $temp; //Traverse through the list till the middle of the list is reached $temp = $temp>next; } //$current will point to new node $current>next = $newNode; //new node will point to temp $newNode>next = $temp; } $this>size++; } //Displays all the nodes in the list function display() { $current = $this>head; if($this>head == NULL) { echo "List is empty"; } else { do{ echo(" $current>data"); $current = $current>next; }while($current != $this>head); echo "<br>"; } } } $cl = new CreateList(); //Adds data to the list $cl>add(1); $cl>add(2); $cl>add(3); $cl>add(4); echo "Original list: <br>"; $cl>display(); //Inserting node '5' in the middle $cl>addInMid(5); echo "Updated List: <br>"; $cl>display(); //Inserting node '6' in the middle $cl>addInMid(6); echo "Updated List: <br>"; $cl>display(); ?> </body> </html> Output: Original list: 1 2 3 4 Updated List: 1 2 5 3 4 Updated List: 1 2 5 6 3 4
Next Topic#
