{"id":564,"date":"2024-01-03T13:18:21","date_gmt":"2024-01-03T13:18:21","guid":{"rendered":"https:\/\/www.kaashivinfotech.com\/blog\/?p=564"},"modified":"2024-01-03T13:18:21","modified_gmt":"2024-01-03T13:18:21","slug":"reverse-a-linked-list","status":"publish","type":"post","link":"https:\/\/www.kaashivinfotech.com\/blog\/reverse-a-linked-list\/","title":{"rendered":"Reverse a Linked List"},"content":{"rendered":"

Reverse a Linked List<\/strong><\/h2>\n

Problem Statement<\/strong><\/h2>\n

Given a singly linked list, the task is to reverse the list, meaning that the last node becomes the first node, the second-to-last node becomes the second node, and so on.<\/p>\n

Recursive Approach<\/strong><\/h2>\n

The recursive approach to reversing a linked list involves breaking the problem into smaller subproblems. Here are the general steps:<\/p>\n

    \n
  • Divide the linked list into two parts: the first node (head) and the rest of the list (the linked list without the first node).<\/li>\n
  • Recursively reverse the rest of the linked list.<\/li>\n
  • After the recursion, change the next of the last node of the reversed rest to point to the first node.<\/li>\n
  • Set the next of the first node to NULL to make it the new tail.<\/li>\n<\/ul>\n

    Implementation of Recursive Approach<\/strong><\/h2>\n

    C++ Implementation<\/strong><\/h3>\n

    #include <iostream><\/p>\n

    class Node {public:int data;Node* next;Node(int data) : data(data), next(nullptr) {}};Node* reverseLinkedList(Node* head) {if (head == nullptr || head->next == nullptr) {return head;}Node* restReversed = reverseLinkedList(head->next);head->next->next = head;head->next = nullptr;return restReversed;}void printLinkedList(Node* head) {while (head != nullptr) {std::cout << head->data << " ";head = head->next;}std::cout << std::endl;}int main() {Node* head = new Node(1);head->next = new Node(2);head->next->next = new Node(3);head->next->next->next = new Node(4);std::cout << "Original Linked List: ";printLinkedList(head);head = reverseLinkedList(head);std::cout << "Reversed Linked List: ";printLinkedList(head);return 0;}<\/code><\/pre> 
     <\/div> <\/div>\n
    Java Implementation<\/strong><\/h3>\n
     
    class Node {int data;Node next;Node(int data) {this.data = data;this.next = null;}}public class ReverseLinkedList {public static Node reverseLinkedList(Node head) {if (head == null || head.next == null) {return head;}Node restReversed = reverseLinkedList(head.next);head.next.next = head;head.next = null;return restReversed;}public static void printLinkedList(Node head) {while (head != null) {System.out.print(head.data + " ");head = head.next;}System.out.println();}public static void main(String[] args) {Node head = new Node(1);head.next = new Node(2);head.next.next = new Node(3);head.next.next.next = new Node(4);System.out.print("Original Linked List: ");printLinkedList(head);head = reverseLinkedList(head);System.out.print("Reversed Linked List: ");printLinkedList(head);}}<\/code><\/pre> 
     <\/div> <\/div>\n
    Python Implementation<\/strong><\/h3>\n
     
    class ListNode:def __init__(self, data):self.data = dataself.next = Nonedef reverseLinkedList(head):if head is None or head.next is None:return headrestReversed = reverseLinkedList(head.next)head.next.next = headhead.next = Nonereturn restReverseddef printLinkedList(head):while head:print(head.data, end=" ")head = head.nextprint()# Helper function to create a linked list from a listdef createLinkedList(arr):if not arr:return Nonehead = ListNode(arr[0])current = headfor item in arr[1:]:current.next = ListNode(item)current = current.nextreturn head# Helper function to print a linked listdef printLinkedList(head):while head:print(head.data, end=" ")head = head.nextprint()if __name__ == "__main__":arr = [1, 2, 3, 4]head = createLinkedList(arr)print("Original Linked List:", end=" ")printLinkedList(head)head = reverseLinkedList(head)print("Reversed Linked List:", end=" ")printLinkedList(head)<\/code><\/pre> 
     <\/div> <\/div>\n
    Iterative Approach<\/strong><\/h2>\n
    The iterative approach to reversing a linked list involves traversing the list once and modifying the next pointers of each node to reverse the direction of the list.<\/p>\n
    Dry Run of the Iterative Approach<\/strong><\/h2>\n
    Let’s dry run the iterative approach on a simple example:<\/p>\n
    Original Linked List: 1 -> 2 -> 3 -> 4 -> null<\/p>\n
      \n
    1. Initialize three pointers: prev = null, current = head (1st node), and next = null.<\/li>\n
    2. Iterate through the linked list.<\/li>\n<\/ol>\n
        \n
      • \n
          \n
        • In each iteration, update the next pointer of the current node to point to the previous node (reverse the link).<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n
            \n
          • Update prev to be the current node.<\/li>\n
          • Update current to be the next node (move forward).<\/li>\n<\/ul>\n
              \n
            1. After the loop, update the head to be prev, which is now pointing to the new first node (4).<\/li>\n
            2. The reversed linked list is now: 4 -> 3 -> 2 -> 1 -> null.<\/li>\n<\/ol>\n
              Implementation of Iterative Approach<\/strong><\/h2>\n
              C++ Implementation<\/strong><\/h3>\n
              #include <iostream><\/p>\n
               
              class Node {public:int data;Node* next;Node(int data) : data(data), next(nullptr) {}};Node* reverseLinkedList(Node* head) {Node* prev = nullptr;Node* current = head;Node* next = nullptr;while (current != nullptr) {next = current->next;current->next = prev;prev = current;current = next;}return prev; \/\/ New head of the reversed list}void printLinkedList(Node* head) {while (head != nullptr) {std::cout << head->data << " ";head = head->next;}std::cout << std::endl;}int main() {Node* head = new Node(1);head->next = new Node(2);head->next->next = new Node(3);head->next->next->next = new Node(4);std::cout << "Original Linked List: ";printLinkedList(head);head = reverseLinkedList(head);std::cout << "Reversed Linked List: ";printLinkedList(head);return 0;}<\/code><\/pre> 
               <\/div> <\/div>\n
              Java Implementation<\/strong><\/h3>\n
               
              class Node {int data;Node next;Node(int data) {this.data = data;this.next = null;}}public class ReverseLinkedList {public static Node reverseLinkedList(Node head) {Node prev = null;Node current = head;Node next = null;while (current != null) {next = current.next;current.next = prev;prev = current;current = next;}return prev; \/\/ New head of the reversed list}public static void printLinkedList(Node head)<\/code><\/pre> 
               <\/div> <\/div>\n
              FAQs<\/strong><\/h2>\n
              1.What is a linked list?<\/strong><\/h3>\n
              A linked list is a linear data structure consisting of nodes, where each node points to the next node in the sequence. It’s used to store and manage a collection of elements.<\/p>\n
              2.Why would you want to reverse a linked list?<\/strong><\/h3>\n
              Reversing a linked list can be useful in various scenarios, such as when you need to process elements in a different order, search for elements from the end, or improve the efficiency of certain operations.<\/p>\n
              3.What is the difference between reversing a linked list iteratively and recursively?<\/strong><\/h3>\n
              The iterative approach reverses the linked list by iteratively modifying the next pointers of each node to change the direction of the list. The recursive approach divides the problem into smaller subproblems, recursively reverses the rest of the list, and then combines the results.<\/p>\n
              4.Is there a preferred approach (iterative vs. recursive) for reversing a linked list?<\/strong><\/h3>\n
              The choice between the iterative and recursive approaches often depends on personal preference and the specific requirements of the problem. Both approaches are valid and can achieve the same result.<\/p>\n
              5.What is the time complexity of reversing a linked list?<\/strong><\/h3>\n
              Both the iterative and recursive approaches have a time complexity of O(n), where n is the number of nodes in the linked list. This is because they visit each node once.<\/p>\n","protected":false},"excerpt":{"rendered":"
              Reverse a Linked List Problem Statement Given a singly linked list, the task is to reverse the list, meaning that the last node becomes the first node, the second-to-last node becomes the second node, and so on. Recursive Approach The recursive approach to reversing a linked list involves breaking the problem into smaller subproblems. Here […]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2191],"tags":[2493,2483,2498,2484,2487,2489,2491,2482,2497,2492,2490,2494,2496,2488,2485,2495,2486],"class_list":["post-564","post","type-post","status-publish","format-standard","hentry","category-problems","tag-code-to-reverse-a-linked-list","tag-how-to-reverse-a-linked-list","tag-iterative-method-to-reverse-a-linked-list","tag-linked-list","tag-linked-list-reverse","tag-linked-lists","tag-reverse-a-link-list","tag-reverse-a-linked-list","tag-reverse-a-linked-list-iterative-method","tag-reverse-a-linked-list-c","tag-reverse-a-linked-list-in-java","tag-reverse-a-linked-list-python","tag-reverse-a-linked-list-using-recursion","tag-reverse-a-linkedlist","tag-reverse-a-singly-linked-list","tag-reverse-a-singly-linked-list-c-program","tag-reverse-linked-list"],"_links":{"self":[{"href":"https:\/\/www.kaashivinfotech.com\/blog\/wp-json\/wp\/v2\/posts\/564","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kaashivinfotech.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.kaashivinfotech.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.kaashivinfotech.com\/blog\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kaashivinfotech.com\/blog\/wp-json\/wp\/v2\/comments?post=564"}],"version-history":[{"count":0,"href":"https:\/\/www.kaashivinfotech.com\/blog\/wp-json\/wp\/v2\/posts\/564\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.kaashivinfotech.com\/blog\/wp-json\/wp\/v2\/media?parent=564"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.kaashivinfotech.com\/blog\/wp-json\/wp\/v2\/categories?post=564"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.kaashivinfotech.com\/blog\/wp-json\/wp\/v2\/tags?post=564"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}