Print Reverse

You are given the pointer to the head node of a linked list and you need to print all its elements in reverse order from tail to head, one element per line. The head pointer may be null meaning that the list is empty - in that case, do not print anything!

Input Format

You have to complete the reversePrint(SinglyLinkedListNode* head) method which takes one argument - the head of the linked list. You should NOT read any input from stdin/console. The input of each test case is as follows:

• First line denotes number of elements n

• The next n lines contain one element each, denoting the elements of the linked list in the order.

Sample Input1

5

16

12

4

2

5

Sample Output1

5

2

4

12

16

SampleInput2

3

7

3

9

Sample Output2

9

3

7

Sample Input3

5

5

1

18

3

13

Sample Output3

13

3

18

1

5

Explanation

•There are three test cases. The first linked list has 5 elements: 16 -> 12 -> 4 -> 2 -> 5. Printing this in reverse order will produce: 5 -> 2 -> 4 -> 12 -> 16. The second linked list has 3 elements: 7 -> 3 -> 9. Printing this in reverse order will produce: 9 -> 3 -> 7. The third linked list has 5 elements: 5 -> 1 -> 18 -> 3 -> 13. Printing this in reverse order will produce: 13 -> 3 -> 18 -> 1 -> 5.