Python solution for reverse linked list

Author: dsrao711

DSA 450 GFG/next_greater_element.py

@@ -1,7 +1,6 @@
 #https://leetcode.com/problems/reverse-linked-list/
 
 # Iterative method
-
 #Approach : 
 
 # Store the head in a temp variable called current . 

DSA 450 GFG/reverse_linked_list_iterative.py

@@ -1,5 +1,4 @@
 # Approach :
-
 # Divide the linked list to two halved
 # First half is head and the remaining as rest 
 # The head points to the rest in a normal linked list 
@@ -12,6 +11,8 @@
 #     def __init__(self, val=0, next=None):
 #         self.val = val
 #         self.next = next
+
+
 class Solution:
     def reverseList(self, head):
         if head is None or head.next is None: