Facebook Page Twitter Page LinkedIn Page
× C# Data Structures - Circular Singly Linked List Other Related Topics


In this method, the first node of the circular singly linked list is deleted. For example - if the given list is 10->20->30->40 and the first node is deleted, the list becomes 20->30->40.

Deleting the first node of the circular singly linked list is very easy. If the list contains one node, delete the node. If the list contains more than one node, then create two nodes - temp and firstNode both pointing to the head. Using temp node, traverse to the last node of the list. Make next of head as the head node and next of last node as head. Finally, delete the first node.

Circular Singly Linked List - Delete First Node

The function pop_front is created for this purpose. It is a 4-step process.

public void pop_front() {
  if(this.head != null) {
    
    //1. the list contains one node, delete
    //   make the head null
    if(this.head.next == this.head) {
      this.head = null;
    } else {
      
      //2. if the list contains more than one node,
      //   create two nodes - temp and firstNode, both
      //   pointing to head node
      Node temp = this.head;
      Node firstNode = this.head;
      
      //3. using temp node, traverse to the last node
      while(temp.next != this.head) {
        temp = temp.next;
      }
      
      //4. Make head as next of head,
      //   Make next of last node as head,
      //   delete the firstNode
      this.head = this.head.next;
      temp.next = this.head; 
      firstNode = null; 
    }
  }
}

The below is a complete program that uses above discussed concept of deleting the first node of the circular singly linked list.

using System;

//node structure
class Node {
  public int data;
  public Node next;
};

class LinkedList {
  Node head;

  public LinkedList(){
    head = null;
  }
  
  //Add new element at the end of the list
  public void push_back(int newElement) {
    Node newNode = new Node();
    newNode.data = newElement;
    newNode.next = null; 
    if(head == null) {
      head = newNode;
      newNode.next = head;
    } else {
      Node temp = new Node();
      temp = head;
      while(temp.next != head)
        temp = temp.next;
      temp.next = newNode;
      newNode.next = head;
    }    
  }

  //Delete first node of the list
  public void pop_front() {
    if(this.head != null) {
      if(this.head.next == this.head) {
        this.head = null;
      } else {
        Node temp = this.head;
        Node firstNode = this.head;
        while(temp.next != this.head) {
          temp = temp.next;
        }
        this.head = this.head.next;
        temp.next = this.head; 
        firstNode = null; 
      }
    }
  }

  //display the content of the list
  public void PrintList() {
    Node temp = new Node();
    temp = this.head;
    if(temp != null) {
      Console.Write("\nThe list contains: ");
      while(true) {
        Console.Write(temp.data + " ");
        temp = temp.next;
        if(temp == this.head)
          break;        
      }
    } else {
      Console.Write("\nThe list is empty.");
    }
  }      
};

// test the code
class Implementation {  
  static void Main(string[] args) {
    LinkedList MyList = new LinkedList();

    //Add four elements in the list.
    MyList.push_back(10);
    MyList.push_back(20);
    MyList.push_back(30);
    MyList.push_back(40);
    MyList.PrintList();   

    //Delete the first node
    MyList.pop_front();
    MyList.PrintList();  
  }
}

The above code will give the following output:

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