Question: How do you reverse a linked list in place? Explain? Write an algorithm to reverse a list Input: Head of following linked list 1->2->3->4->

How do you reverse a linked list in place? Explain? Write an 

How do you reverse a linked list in place? Explain? Write an algorithm to reverse a list Input: Head of following linked list 1->2->3->4-> NULL Output: Linked list should be changed to, 4->3->2->1->NULL Input: Head of following linked list 1->2->3->4->5->NULL Output: Linked list should be changed to, 5->4->3->2->1-> NULL Input: NULL Output: NULL Input: 1->NULL Output: 1->NULL

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

To reverse a linked list in place we can use three pointers prev current and next Heres how the a... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!