linked structures an array is the most basic sequence container used to store and access collection of data it provides easy and direct access to the individual elements and is supported at the hardware level but arrays are limited in their functionality the python listwhich is also sequence containeris an abstract sequence type implemented using an array structure it extends the functionality of an array by providing larger set of operations than the arrayand it can automatically adjust in size as items are added or removed the array and python list can be used to implement many different abstract data types they both store data in linear order and provide easy access to their elements the binary search can be used with both structures when the items are stored in sorted order to allow for quick searches but there are several disadvantages in the use of the array and python list firstinsertion and deletion operations typically require items to be shifted to make room or close gap this can be time consumingespecially for large sequences secondthe size of an array is fixed and cannot change while the python list does provide for an expandable collectionthat expansion does not come without cost since the elements of python list are stored in an arrayan expansion requires the creation of new larger array into which the elements of the original array have to be copied finallythe elements of an array are stored in contiguous bytes of memoryno matter the size of the array each time an array is createdthe program must find and allocate block of memory large enough to store the entire array for large arraysit can be difficult or impossible for the program to locate block of memory into which the array can be stored this is especially true in the case of python list that grows larger during the execution of program since each expansion requires ever larger blocks of memory in this we introduce the linked list data structurewhich is general purpose structure that can be used to store collection in linear order the linked list improves on the construction and management of an array and python list by requiring smaller memory allocations and no element shifts for insertions and