Solving Problem: Reverse a Linked List

class Node:
   def __init__(self, data):
       self.data = data
       self.next = None
def reverse_list(head):
   prev = None
   curr = head
   while curr:
       next = curr.next
       curr.next = prev
       prev = curr
       curr = next
   return prev
def print_list(node):
   while node:
       print(node.data, end=" -> ")
       node = node.next
   print("NULL")
# Example usage
head = Node(1)
head.next = Node(2)
head.next.next = Node(3)
head.next.next.next = Node(4)
head.next.next.next.next = Node(5)
print("Given Linked List:")
print_list(head)
reversed_head = reverse_list(head)
print("Reversed Linked List:")
print_list(reversed_head)