> For the complete documentation index, see [llms.txt](https://nitinranganath.gitbook.io/data-structures/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://nitinranganath.gitbook.io/data-structures/doubly-linked-list/circular-doubly-linked-list.md).

# Circular Doubly Linked List

### Inserting a Node :

```c
void insert(struct node *ptr, int data, int pos) {

    // Creating a node
    struct node *newNode;
    newNode = (struct node *)malloc(sizeof(struct node));
    newNode -> data = data;

    // If node needs to be inserted at first position
    if (pos == 1) {
        if (head == NULL) {
            // If linked list is empty
            head = newNode;
            head -> prev = head;
            head -> next = head;
        } else {
            // If other nodes are present
            newNode -> prev = head -> prev;
            newNode -> next = head;
            head -> prev = newNode;
            newNode -> prev -> next = newNode;
            head = newNode;
        }
    }

    // If node is to be inserted at any other position
    else {
        for (int i = 0; i < pos - 2; i++) {
            ptr = ptr -> next;
        }
        // Change the links
        newNode -> next = ptr -> next;
        newNode -> prev = ptr;
        ptr -> next -> prev = newNode;
        ptr -> next = newNode;
    }
    
}
```

### Deleting a Node :

```c
void delete(struct node *ptr, int pos) {

    // If the head node is to be deleted
    if (pos == 1) {
        head -> prev -> next = head -> next;
        head -> next -> prev = head -> prev;
        head = head -> next;
        free(ptr);
    } 
    
    else {
        // Traverse to the node to be deleted
        for (int i = 0; i < pos - 1; i++) {
            ptr = ptr -> next;
        }
        // Change the links
        ptr -> prev -> next = ptr -> next;
        ptr -> next -> prev = ptr -> prev;
        //  Deallocate the memory
        free(ptr);
    }
    
}
```

### Displaying the Nodes :

```c
void display(struct node *ptr) {

    // If linked list is empty
    if (ptr == NULL) {
        printf("Linked list is empty\n");
        return;
    }
    
    do {
        printf("%d\t", ptr -> data);
        ptr = ptr -> next;
    }
    while (ptr != head);
    printf("\n");
    
}
```

Contributed by Nitin Ranganath


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:

```
GET https://nitinranganath.gitbook.io/data-structures/doubly-linked-list/circular-doubly-linked-list.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.