What is a reverse linked list.
- 1 Answers
- 1145 Views
- Aspiring Minds, I also Faced
- E-Mail Answers
Answer / Gaurav Goel
A reverse linked list, also known as a singly reversed linked list, is a data structure similar to a singly linked list, but the links between nodes point in the opposite direction. In other words, each node's next pointer points to its previous node instead of its successor. This allows us to traverse the list from the tail to the head.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is the difference between hashmap and linkedhashmap?
Why do we Use a Multidimensional Array?
Explain extended binary tree.
Which interfaces are implemented by concurrentskiplistset?
ple.. briefly describe the purpose of having a base case and a recursive case in a recursive algorithm
When would you use a tuple?
What is difference between list and array list?
What thread means?
How can avl tree be useful in all the operations as compared to binary search tree?
What do you understand by stable sort?
Explain Stack
What is a map programming?
Windows 
