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): DoublyLinkedListNode head: a reference to the head of a DoublyLinkedList Returns - DoublyLinkedListNode: a reference to the head of the reversed list 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 :
// Complete the reverse function below.
/*
* For your reference:
*
* DoublyLinkedListNode {
* int data;
* DoublyLinkedListNode* next;
* DoublyLinkedListNode* prev;
* };
*
*/
DoublyLinkedListNode* reverse(DoublyLinkedListNode* head) {
struct DoublyLinkedListNode *prev,*curr,*next;
curr=head;
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;
}
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
}
*/
Node* Reverse(Node* head)
{
// Complete this function
// Do not write the main method.
Node *temp = NULL;
Node *current = head;
/* swap next and prev for all nodes of
doubly linked list */
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 )
head = temp->prev;
return head;
}
Solution in Java :
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;
}
*/
Node Reverse(Node head) {
if(head==null)
return null;
if(head.next==null)
return head;
Node temp=head;
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;
}
Solution in Python :
In python3 :
def Reverse(head):
if head == None or head.next == None:
return head
prev = head
curr = head.next
while curr.next != None:
prev, curr = curr, curr.next
head = curr
while prev != None:
curr.prev = curr.next
curr.next = prev
prev.next = prev.prev
prev.prev = curr
prev, curr = prev.next, prev
return head
View More Similar Problems
Reverse a linked list
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
View Solution →Compare two linked lists
You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. If all data attributes are equal and the lists are the same length, return 1. Otherwise, return 0. Example: list1=1->2->3->Null list2=1->2->3->4->Null The two lists have equal data attributes for the first 3 nodes. list2 is longer, though, so the lis
View Solution →Merge two sorted linked lists
This challenge is part of a tutorial track by MyCodeSchool Given pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. Example headA refers to 1 -> 3 -> 7 -> NULL headB refers to 1 -> 2 -> NULL The new list is 1 -> 1 -> 2 -> 3 -> 7 -> NULL. Function Description C
View Solution →Get Node Value
This challenge is part of a tutorial track by MyCodeSchool Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. Example head refers to 3 -> 2 -> 1 -> 0 -> NULL positionFromTail = 2 Each of the data values matches its distance from the t
View Solution →Delete duplicate-value nodes from a sorted linked list
This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty. Example head refers to the first node in the list 1 -> 2 -
View Solution →Cycle Detection
A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example head refers 1 -> 2 -> 3 -> NUL The numbers shown are the node numbers, not their data values. There is no cycle in this list so return 0. head refer
View Solution →