data structures using would denote the end of the linked list when we traverse data and next in this mannerwe finally see that the linked list in the above example stores characters that when put together form the word hello note that fig shows chunk of memory locations which range from to the shaded portion contains data for other applications remember that the nodes of linked list need not be in consecutive memory locations in our examplethe nodes for the linked list are stored at addresses and let us take another example to see how two linked lists are maintained together in the computer' memory for examplethe students of class xi of science group are asked to choose between biology and computer science nowwe will maintain two linked listsone for each subject that isthe first linked list will contain the roll numbers of all the students who have opted for biology and the second list will contain the roll numbers of students who have chosen computer science nowlook at fig two different linked lists are simultaneously maintained in the memory there is no ambiguity in traversing through the list because each list maintains separate start pointerwhich gives the address of the first node of their respective linked lists the rest of the start next roll no nodes are reached by looking at the value stored (biologys in the next by looking at the figurewe can conclude that roll numbers of the students who have opted for start biology are and (computer science similarlyroll numbers of the students who chose computer science are and we have already said that the data part of node may contain just single data iteman arrayor structure let us take an example to see how structure is maintained in linked list that is stored - in the memory consider scenario in which the roll number nameaggregateand grade of students are stored - using linked lists nowwe will see how the next pointer is used to store the data alphabetically figure two linked lists which are simultaneously maintained in the memory this is shown in fig linked lists versus arrays both arrays and linked lists are linear collection of data elements but unlike an arraya linked list does not store its nodes in consecutive memory locations another point of difference between an array and linked list is that linked list does not allow random access of data nodes 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 another advantage of linked list over an array is that we can add any number of elements in the list this is not possible in case of an array for exampleif we declare an array as int marks[ ]then the array can store maximum of data elements only there is no such restriction in case of linked list