# Reverse a doubly linked list

### Problem Statement :

```This challenge is part of a tutorial track by MyCodeSchool

Given the pointer to the head node of a doubly linked list, reverse the order of the nodes in place. That is, change the next and prev pointers of the nodes so that the direction of the list is reversed. Return a reference to the head node of the reversed list.

Note: The head node might be NULL to indicate that the list is empty.

Function Description

Complete the reverse function in the editor below.

reverse has the following parameter(s):

Returns

Input Format

The first line contains an integer t, the number of test cases.

Each test case is of the following format:

The first line contains an integer n, the number of elements in the linked list.
The next n lines contain an integer each denoting an element of the linked list.```

### Solution :

```                            ```Solution in C :

In C++ :

/*
Reverse a doubly linked list, input list may also be empty
Node is defined as
struct Node
{
int data;
Node *next;
Node *prev
}
*/
{
// Complete this function
// Do not write the main method.

Node *temp = NULL;

/* swap next and prev for all nodes of
while (current !=  NULL)
{
temp = current->prev;
current->prev = current->next;
current->next = temp;
current = current->prev;
}

/* Before changing head, check for the cases like empty
list and list with only one node */
if(temp != NULL )

}

In Java :

/*
Insert Node at the end of a linked list
head pointer input could be NULL as well for empty list
Node is defined as
class Node {
int data;
Node next;
Node prev;
}
*/

return null;

Node next=temp.next;
while(next!=null)
{

temp.next=temp.prev;
temp.prev=next;
temp=next;
next=next.next;

}

temp.next=temp.prev;
temp.prev=null;
return temp;

}

In python3 :

while curr.next != None:
prev, curr = curr, curr.next

while prev != None:
curr.prev = curr.next
curr.next = prev
prev.next = prev.prev
prev.prev = curr
prev, curr = prev.next, prev

In C :

// Complete the reverse function below.

/*
*
*     int data;
* };
*
*/
prev=NULL;
while(curr)
{
next=curr->next;
curr->next=prev;
curr->prev=next;
if(next==NULL)break;
prev=curr;curr=next;
}
curr->prev=NULL;return curr;

}```
```

## Delete a Node

Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example: list=0->1->2->3 position=2 After removing the node at position 2, list'= 0->1->-3. Function Description: Complete the deleteNode function in the editor below. deleteNo

## Print in Reverse

Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing

Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio