LinkedList.py

class Node:
    def __init__(self,value):
        self.value = value
        self.next = None

class LinkedList:
    def __init__(self,value):
        new_node = Node(value)
        self.head = new_node
        self.tail = new_node
        self.length = 1
        
    def print_list(self):
         temp = self.head
         while temp is not None:
                print(temp.value)
                temp = temp.next

    def append_Item(self,value):
        new_node = Node(value)
        if self.head is None:
                self.head = new_node
                self.tail = new_node
        else:
             self.tail.next = new_node
             self.tail = new_node
        self.length += 1
        return True
    
    def pop_Item(self):
        if self.length == 0:
            return None
        temp = self.head
        pre = self.head
        while(temp.next):
            pre = temp
            temp = temp.next
        self.tail = pre
        self.tail.next = None
        self.length -= 1
        if self.length == 0:
            self.head = None
            self.tail = None
        return temp
    
    def prepend_Item(self, value):
        new_node = Node(value)
        if self.length == 0:
              self.head = new_node
              self.tail = new_node
        else:
              new_node.next = self.head
              self.head = new_node
              self.length += 1
              return True

    def pop_first_Item(self):
        if self.length == 0:
                return None
        temp = self.head
        self.head = self.head.next 
        temp.next = None
        self.length -= 1
        if self.length == 0:
              self.tail = None
        return temp
    
    def get_Item(self, index):
        if index < 0 or index >= self.length:
              return None  
        temp = self.head
        for _ in range(index):
              temp = temp.next
        return temp
    
    def set_Item_Value(self, index, value):
        temp = self.get_Item(index)
        if temp:
            temp.value = value
            return True
        return False

    def insert_Item(self, index, value):
         if index < 0 or index > self.length:
              return False
         if index == 0:
              return self.prepend_Item(value)
         if index == self.length:
              return self.append_Item(value)
         new_node = Node(value)
         temp = self.get_Item(index - 1)
         new_node.next = temp.next
         temp.next  = new_node
         self.length += 1
         return True

    def remove_Item(self, index):
         if index < 0 or index > self.length:
              return None
         if index == 0:
              return self.pop_first_Item()
         if index == self.length - 1:
              return self.pop_Item()
         prev = self.get_Item(index -1)
         temp = prev.next
         prev.next = temp.next
         temp.next = None
         self.length -= 1
         return temp
    
    def reverse_List(self):
     temp = self.head
     self.head = self.tail
     self.tail = temp
     after = temp.next
     before = None
     for _ in range(self.length):
          after = temp.next
          temp.next = before
          before = temp
          temp = after
          
main_LL = LinkedList(1)
main_LL.print_list()