A Static Data Structure

Array is the most fundamental data structure built into many programming languages. It is also used to implement many other data structures. Indeed, our first choice was to use an array to implement IndexedList ADT.

Arrays have their limitations too; they are static structures and therefore cannot be easily extended or reduced to fit the data set. It is also expensive to insert/delete from the front or middle of an array.

In this lecture, we explore another fundamental data structure called Linked List that does not have the limitations of arrays.