A New Vista of Performing Insertion and Deletion in Linked Lists

Insertion and deletion in linked lists. Linked lists are an example of linear data structures. They are made up of nodes which are connected to each other. The data can be accessed by sequential manner. In this paper we will create an abstract model of linked list where the creation of a linked list of n nodes will take a time complexity of O(n) and the insertion and deletion will take a time complexity of O(1) or constant time at the tail position and head position and also reduce the runtime of insertion and deletion at middle or any index in between to some extent. This abstract model of the linked list can also be used as a stack and a queue because it will contain all properties of stack and queue data structures.