**Reverse a linked list**

### Problem Statement :

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 Description: Complete the reverse function in the editor below. reverse has the following parameter: SinglyLinkedListNode pointer head: a reference to the head of a list Returns SinglyLinkedListNode pointer: 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 has the following format: 1. The first line contains an integer n, the number of elements in the linked list. 2. Each of the next n lines contains an integer, the data values of the elements in the linked list. Constraints: 1. 1<=t<=10 2. 1<=n<=1000 3. 1<=list[i]<=1000

### Solution :

` ````
Solution in C :
In C:
//the following function is all that is needed to complete the
//challenge in hackerrank platform.
SinglyLinkedListNode* reverse(SinglyLinkedListNode* head) {
struct SinglyLinkedListNode* new_head = NULL;
struct SinglyLinkedListNode* temp;
while(head != NULL){
temp = head->next;
head->next = new_head;
new_head = head;
head = temp;
}
return new_head;
}
In C++:
//the following function is all that is needed to complete the
//challenge in hackerrank platform.
Node* Reverse(Node *head)
{
// Complete this method
Node* prev = NULL;
Node* current = head;
Node* next;
while (current != NULL)
{
next = current->next;
current->next = prev;
prev = current;
current = next;
}
return prev;
}
In Java:
//the following method is all that is needed to complete the
//challenge in hackerrank platform.
static SinglyLinkedListNode reverse(SinglyLinkedListNode head) {
SinglyLinkedListNode next = null;
SinglyLinkedListNode current = head;
SinglyLinkedListNode previous = null;
while(current!=null)
{
next = current.next;
current.next = previous;
previous = current;
current = next;
}
SinglyLinkedListNode singlyLinkedListNode = previous;
return singlyLinkedListNode;
}
In Python 3:
//the following method is all that is needed to complete the
//challenge in hackerrank platform.
def Reverse(head):
current = head
prev = None
next = None
while current is not None:
next = current.next
current.next = prev;
prev = current;
current = next;
return prev
```

## View More Similar Problems

## Reverse a doubly linked list

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.

View Solution →## Tree: Preorder Traversal

Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's

View Solution →## Tree: Postorder Traversal

Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the

View Solution →## Tree: Inorder Traversal

In this challenge, you are required to implement inorder traversal of a tree. Complete the inorder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values. Input Format Our hidden tester code passes the root node of a binary tree to your $inOrder* func

View Solution →## Tree: Height of a Binary Tree

The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height : image Function Description Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer. getHeight or height has the following parameter(s): root: a reference to the root of a binary

View Solution →## Tree : Top View

Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example : 1 \ 2 \ 5 / \ 3 6 \ 4 Top View : 1 -> 2 -> 5 -> 6 Complete the function topView and print the resulting values on a single line separated by space.

View Solution →