Reverse a singly linked list.
Example:

Input: 1-&gt;2-&gt;3-&gt;4-&gt;5-&gt;NULL
Output: 5-&gt;4-&gt;3-&gt;2-&gt;1-&gt;NULL

Solution:
Approach 1: Recursive 
<pre><code> ListNode* reverseList(ListNode* head) {
 if(head==NULL || head-&gt;next==NULL)
 return head;
 ListNode* prev = reverseList(head-&gt;next);
 head-&gt;next-&gt;next=head;
 head-&gt;next=NULL;
 return prev;
 }
</code></pre>

Reverse a singly linked list.

Example:**
**
Input: 1->2->3->4->5->NULL
Output: 5->4->3->2->1->NULL
**
Solution:**

**Approach 1: Recursive **


```
    ListNode* reverseList(ListNode* head) {
        if(head==NULL || head->next==NULL)
            return head;
        ListNode* prev = reverseList(head->next);
        head->next->next=head;
        head->next=NULL;
        return prev;
    }

``` 


Reverse Linked List | Problem No. 206 | LeetCode