linked lists in this links simple linked list finding and deleting in "arrays,we saw that arrays had certain specified links disadvantages as data storage structures in an unordered arraysearching is slowwhereas in an ordered arrayinsertion is slow in both kinds of arraysdeletion is slow alsothe size of an array can' be changed after it' created double-ended lists in this we'll look at data storage structure that solves some of these problemsthe linked list linked lists are probably the second most commonly used generalpurpose storage structures after arrays sorted lists the linked list is versatile mechanism suitable for use in many kinds of general-purpose databases it can also replace an array as the basis for other storage structures such as stacks and queues in factyou can use linked list in many cases in which you use an arrayunless you need frequent random access to individual items using an index linked lists aren' the solution to all data storage problemsbut they are surprisingly versatile and conceptually simpler than some other popular structures such as trees we'll investigate their strengths and weaknesses as we go along in this we'll look at simple linked listsdoubleended listssorted listsdoubly linked listsand lists with iterators (an approach to random access to list elementswe'll also examine the idea of abstract data types (adts)and see how stacks and queues can be viewed as adts and how they can be implemented as linked lists instead of arrays links in linked listeach data item is embedded in link link is an object of class called something like link because there are many similar links in listit makes sense to use separate class for themdistinct from the linked-list efficiency abstract data types doubly linked lists iterators