# Doubly Circular Linked List Introduction and Insertion

### Introduction

The linked list is one of the most important concepts and data structures to learn while preparing for interviews. Having a good grasp of Linked Lists can be a huge plus point in a coding interview.

• A Doubly Linked List is a linked data structure that is represented as a set of nodes.
• A node in a doubly linked list is an object which contains a value, a reference to the previous node of the list and a reference to the next node of the list.
• A doubly linked list consists of two node pointers next and prev, which point to next and previous nodes, respectively.
• Unlike the singly linked list, we can traverse in both directions in a doubly-linked list with the help of these next and prev pointers.

• A Doubly Circular Linked List is a data structure that has properties of both Circular Linked List and Doubly Linked List.
• It is a list in which the last node of the list points to the start node, creating a loop.
• As a doubly circular linked list is a combination of a doubly and a circular linked list, we can traverse in both directions, and also the last node of the list connects to the start node as next, and the start node has the last node in the prev pointer.

#### Structure of node:

```static class Node
{
int data;
Node next;
Node prev;
};
```

### Problem Statement Understanding

We have to create a Doubly Circular Linked List by inserting nodes in the list, i.e., by adding nodes at the start or the end of the List, and after performing all the insertion operations, we need to output the created list.

Suppose we are given an empty linked list and some insertion operations to perform on the linked list. Look at the figure below to see how insertions will happen.  Now I think from the above figure, you got the idea, how insertions will happen in the list. So let's now see the algorithm to do these insertions.

### Approach and Algorithm

• Firstly, we will initialize the start node as NULL, and then we can continue to insert the nodes.
• The following cases persist if we want to insert the nodes:
a) If the list is empty

• We will create a new_node with the given value.
• Assign the prev and next of new_node to the new_node itself.
• Update new_node as the start node.

b) Insert at begin

• We will create a new_node with the given value.
• Assign the next of new_node as the start node.
• Assign the prev of new_node to the last node of the linked list.
• Update the prev of the start node and next of the last node as new_node.
• Update new_node as the start node.

c) Insert at the end

• We will create a new_node with the given value.
• Assign the next of new_node as the start node.
• Assign the prev of new_node to the last node of the list.
• Update the prev of the start node and next of the last node as new_node.
• Update new_node as the last node.
• Using these above insertion operations, our Doubly Circular Linked List will get created.
• Now, finally, once we have inserted all the nodes in the list, we can print the list.

### Dry Run    ### Code Implementation:

```class Prepbytes {

static Node start;

static class Node {
int data;
Node next;
Node prev;
};

static void insertEnd(int value) {

if (start == null) {
Node new_node = new Node();
new_node.data = value;
new_node.next = new_node.prev = new_node;
start = new_node;
return;
}

Node last = (start).prev;

Node new_node = new Node();
new_node.data = value;

new_node.next = start;

(start).prev = new_node;

new_node.prev = last;

last.next = new_node;
}

static void insertBegin(int value) {
if (start == null) {
Node new_node = new Node();
new_node.data = value;
new_node.next = new_node.prev = new_node;
start = new_node;
return;
}

Node last = (start).prev;

Node new_node = new Node();
new_node.data = value;

new_node.next = start;
new_node.prev = last;

last.next = (start).prev = new_node;

start = new_node;
}

static void display() {
Node temp = start;

System.out.printf("\nTraversal in forward direction \n");
while (temp.next != start) {
System.out.printf("%d ", temp.data);
temp = temp.next;
}
System.out.printf("%d ", temp.data);

System.out.printf("\nTraversal in reverse direction \n");
Node last = start.prev;
temp = last;
while (temp.prev != last) {
System.out.printf("%d ", temp.data);
temp = temp.prev;
}
System.out.printf("%d ", temp.data);
}

public static void main(String[] args) {

Node start = null;
insertEnd(7);
insertBegin(3);
insertBegin(4);
insertEnd(6);
insertEnd(9);
insertBegin(8);
insertBegin(5);
System.out.printf("Created circular doubly linked list is: ");
display();
}
}
```

#### Output

Created circular doubly linked list is:
Traversal in forward direction
5 8 4 3 7 6 9
Traversal in reverse direction
9 6 7 3 4 8 5

Time Complexity: O(1) for insertion as insertion is a constant operation.
Space Complexity: O(n), space is required to create n nodes.

So, in this blog, we have discussed Doubly Circular Linked List Introduction and Insertion. If you want to solve more questions on Linked List, which are curated by our expert mentors at PrepBytes, you can follow this link Linked List.