# Reversing a Doubly Linked List

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

    // Temporary pointer for swapping
    struct node *temp;
    
    while (ptr != NULL) {
        // Swapping the links
        temp = ptr -> next;
        ptr -> next = ptr -> prev;
        ptr -> prev = temp;
        // Moving forward
        ptr = ptr -> prev;
        // Condition to set head node
        if (ptr != NULL && ptr -> next == NULL) {
            head = ptr;
        }
    }
    
}
```

Contributed by Nitin Ranganath


---

# Agent Instructions: 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:

```
GET https://nitinranganath.gitbook.io/data-structures/doubly-linked-list/reversing-a-doubly-linked-list.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
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.