add description

Author: akgmage

Linked List/reverse_linked_list.go

@@ -1,3 +1,19 @@
+// Implementation of reversing a linked list recursively and iteratively
+/*
+	In this code, we define a ListNode struct which represents a node in the linked list. We then define two functions:
+	ReverseListIteratively and ReverseListRecursively which reverse the linked list iteratively and recursively, respectively.
+	In ReverseListIteratively, we declare two pointers prev and curr, initialize curr to head, and iterate over the
+	linked list until curr becomes nil. In each iteration, we store the Next pointer of curr in a temporary variable
+	nextTemp, point curr.Next to prev, update prev to curr, and update curr to nextTemp. Finally, we return prev,
+	which now points to the new head of the reversed linked list.
+
+	In ReverseListRecursively, we first check if head is nil or if head.Next is nil, in which case we return head itself.
+	Otherwise, we call ReverseListRecursively on head.Next, which returns the new head of the reversed linked list.
+	We then set head.Next.Next to head and head.Next to nil. Finally, we return the new head.
+
+	In the main function, we create a linked list 1 -> 2 -> 3 -> 4 -> 5, reverse it both iteratively and recursively,
+	and print out the reversed linked lists.
+*/
 package main
 
 import "fmt"