linked lists learning objective linked list is collection of data elements called nodes in which the linear representation is given by links from one node to the next node in this we are going to discuss different types of linked lists and the operations that can be performed on these lists introduction we have studied that an array is linear collection of data elements in which the elements are stored in consecutive memory locations while declaring arrayswe have to specify the size of the arraywhich will restrict the number of elements that the array can store for exampleif we declare an array as int marks[ ]then the array can store maximum of data elements but not more than that but what if we are not sure of the number of elements in advancemoreoverto make efficient use of memorythe elements must be stored randomly at any location rather than in consecutive locations sothere must be data structure that removes the restrictions on the maximum number of elements and the storage condition to write efficient programs linked list is data structure that is free from the aforementioned restrictions linked list does not store its elements in consecutive memory locations and the user can add any number of elements to it howeverunlike an arraya linked list does not allow random access of data elements in linked list can be accessed only in sequential manner but like an arrayinsertions and deletions can be done at any point in the list in constant time basic terminologies linked listin simple termsis linear collection of data elements these data elements are called nodes linked list is data structure which in turn can be used to implement other data