Q14

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None
 
 
class LinkedList:
    
    def __init__(self):
        self.head = None    
 
    # For inserting new node
    def push(self, new_data):
        _new = Node(new_data)
        _new.next = self.head
        self.head = _new
 
    # To print
    def printLList(self):
        temp = self.head
        while(temp):
            print(temp.data),
            temp = temp.next

    # Function to reverse 
    def reverse(self):
        prev = None
        current = self.head
        while(current is not None):
            next = current.next
            current.next = prev
            prev = current
            current = next
        self.head = prev
 
 
# Driver code
llist = LinkedList()
llist.push(40)
llist.push(4)
llist.push(85)
llist.push(15)
 
print("Linked List")
llist.printLList()

print( "Reversed is")
llist.reverse()
llist.printLList()