Example: Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL   This problem can be solved in 2 ways. 1. Iterative 2. Recursive. 1. Iterative solution. In this solution, we need 3 pointers. In this solution, we need 3 pointers. And initialize as shown below: prev = NULL Curr = head Temp = NULL So we iterate and reverse the … Continue reading Reverse Linked List iterative and recursive in C++