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 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
To reverse a linked list in place we can use three pointers prev current and next Heres how the a... View full answer
Get step-by-step solutions from verified subject matter experts
