How to reverse a linked list iterative algorithm?
- 1 Answers
- 1031 Views
- I also Faced
- E-Mail Answers
Answer / Vandana Kanaujia
To reverse a linked list iteratively in an algorithm, follow these steps:
1. Initialize three pointers: prev, curr, and next.
2. Assign the head node as the current node (curr).
3. Set the next pointer of the current node to null.
4. Move the current node to the next node.
5. Change the head of the list to the previous node.
6. Repeat steps 4 and 5 until the current node becomes null.
7. Now, the linked list is reversed.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is linear and non linear structure?
Define splay tree?
Does treeset allow null values?
Can we store a string and integer together in an array?
What is list and types of list?
Which is faster hashmap or treemap?
Which process places data at the back of the queue?
Can you distinguish between ArrayList and Array?
How many parts are there in a declaration statement?
What is advantage and disadvantage of linked list?
Is json a data structure?
Is pointer a variable in data structure?
Windows 
