Reverse a doubly linked list (Python)

[nazuk27]

Given a pointer to the head node of a doubly linked list, reverse the order of the nodes in the list and display the reversed Linked 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.

Output Format:
Print the reversed doubly linked list.

Sample Input:
1
4
1
2
3
4

Sample Output:
4 3 2 1

[nazuk27]

@aditya109 Can you please assign this to me? Thanks!

[aditya109]

Hi @nazuk27 ! Please go on ahead and raise a PR for the same, linking this issue. I am assigning this issue to you. Please consider starring the repo, if you have not already to encourage further contributions.

[MalEl-94]

@nazuk27 Can you please assign this to me. I'd like to attempt this in Java.

[hryxna]

I already have implemented this as well @aditya109 & @MalEl-94 in JAVA 😁.
Check out the Solution

[harshbhagwani94]

@aditya109 can you assign this issue to me as well? I want to do this in C++.

[purva-saxena]

i would like to solve this issue!
can you please assign it to me