Reverse the Linked List. Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL
- 1 Answers
- 887 Views
- I also Faced
- E-Mail Answers
Answer / Ganesh Pratap Singh
To reverse a linked list, you can create a recursive function that swaps the current node's next pointer with its previous node. Here is an example implementation in C++:n```nNode* reverseList(Node* head) {n if (head == NULL || head->next == NULL) return head;n Node* newHead = reverseList(head->next);n head->next->next = head;n head->next = NULL;n return newHead;n}n``
| Is This Answer Correct ? | 0 Yes | 0 No |
What is unary operator? List out the different operators involved in the unary operator.
Explain selection sorting?
what is data abstraction in C++?
What is the difference between Class and Structure?
40 Answers HP, IBM, Samsung, TCS,
Explain how would you handle a situation where you cannot call the destructor of a local explicitly?
What is the best c++ book?
Define a nested class.
Can we use clrscr in c++?
How many types of comments are there in c++?
What are structures and unions?
What are containers in c++?
Can class objects be passed as function arguments?
STL 
