Submitted By: M.

Noman
Submitted To:Dr.Atta ur Rehman
Date:28-11-23
 ASSIGNMENT#1
CODE:
class Node:

def __init__(self, data):

self.data = data

self.next = None

class LinkedList:

def __init__(self):

self.head = None

def append(self, data):

if self.head is None:

print("Linked list is empty")

return

temp = self.head

new_node = Node(data)

while temp.next is not None:

temp = temp.next

temp.next = new_node

def display(self):

current = self.head

while current:

print(current.data, end=" -> ")

current = current.next
 print("None")

def reverse(self):

prev = None

current = self.head

while current:

next_node = current.next

current.next = prev

prev = current

current = next_node

self.head = prev

# Example usage:

linked_list = LinkedList()

linked_list.append(1)

linked_list.append(2)

linked_list.append(3)

linked_list.append(4)

print("Original Linked List:")

linked_list.display()

linked_list.reverse()

print("\nReversed Linked List:")

linked_list.display()
OUTPUT: