**Print in Reverse**

### Problem Statement :

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: SinglyLinkedListNode pointer head: a reference to the head of the list Prints The data values of each node in the reversed list. Input Format: The first line of input contains t, the number of test cases. The input of each test case is as follows: 1. The first line contains an integer n, the number of elements in the list. 2. Each of the next n lines contains a data element for a list node. Constraints: 1. 1<=n<=1000 2. 1<=list[i]<=1000

### Solution :

` ````
Solution in C :
In C:
//the following fuction is all that is needed to complete the
//challenge in hackerrank platform.
void reversePrint(SinglyLinkedListNode* head) {
SinglyLinkedListNode* current=head,*next,*prev=NULL;
while(current!=NULL)
{ next=current->next;
current->next=prev;
prev=current;
current=next;
}
head=prev;
SinglyLinkedListNode* temp=head;
while(temp!=NULL)
{
printf("%d\n",temp->data);
temp=temp->next;
}
}
In C++:
//the following fuction is all that is needed to complete the
//challenge in hackerrank platform.
void ReversePrint(Node *head)
{
// This is a "method-only" submission.
// You only need to complete this method.
if(head!=NULL)
{
ReversePrint(head->next);
cout<<head->data<<"\n";
}
}
In Java:
//the following method is all that is needed to complete the
//challenge in hackerrank platform.
static void reversePrint(SinglyLinkedListNode head) {
if(head.next != null) {
reversePrint(head.next);
}
System.out.println(head.data);
}
In Python 3 :
//the following method is all that is needed to complete the
//challenge in hackerrank platform.
def ReversePrint(head):
if head is None:
return
ReversePrint(head.next)
print(head.data)
```

## View More Similar Problems

## 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 →## Tree: Level Order Traversal

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F

View Solution →## Binary Search Tree : Insertion

You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <

View Solution →## Tree: Huffman Decoding

Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t

View Solution →