Explain the most efficient method to reverse a linked list?
- 1 Answers
- 953 Views
- I also Faced
- E-Mail Answers
Answer / Jay Prakash Verma
The most common and efficient method is recursion. Start with the last node, traverse backwards, and update the next pointer of each node to point to its successor.
| Is This Answer Correct ? | 0 Yes | 0 No |
When is a binary search algorithm best applied?
Differentiate between hashset and treeset.
Why do we use linked lists?
Define path in a graph?
Why is tuple immutable?
What is the best case complexity of quicksort?
Describe the level term in a tree.
input function and output function in c language
What is difference between treeset hashset linkedhashset?
Is it possible to store null key and null values in a hashmap?
What is a threaded binary tree? Explain its operation with example?
Is arraylist heterogeneous?
Windows 
