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


In this method, a new node is inserted at the start of the circular doubly linked list. For example - if the given List is 10->20->30 and a new element 100 is added at the start, the List becomes 100->10->20->30.

Inserting a new node at the start of the circular doubly linked list is very easy. First, a new node with given element is created. It is then added at the start of the list by linking the head node and last node to the new node.

Circular Doubly Linked List - Add Node At Start

The function push_front is created for this purpose. It is a 6-step process.

public void push_front(int newElement) {
  
  //1. allocate node
  Node newNode = new Node();
  
  //2. assign data element
  newNode.data = newElement;
  
  //3. assign null to the next and prev
  //   of the new node
  newNode.next = null;
  newNode.prev = null; 
  
  //4. Check the list is empty or not,
  //   if empty make the new node as head
  if(head == null) {
    head = newNode;
    newNode.next = head;
    newNode.prev = head;
  } else {
    
    //5. Else, traverse to the last node
    Node temp = new Node();
    temp = head;
    while(temp.next != head)
      temp = temp.next;
    
    //6. Adjust the links
    temp.next = newNode;
    newNode.prev = temp;
    newNode.next = head;
    head.prev = newNode;
    head = newNode;
  }    
}

The below is a complete program that uses above discussed concept to insert new node at the start of the circular doubly linked list.

using System;

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

class LinkedList {
  Node head;

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

  //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 three elements at the start of the list.
    MyList.push_front(10);
    MyList.push_front(20);
    MyList.push_front(30);
    MyList.PrintList();   
  }
}

The above code will give the following output:

The list contains: 30 20 10