data structures using howeverif the elements of data structure are not stored in sequential orderthen it is non-linear data structure the relationship of adjacency is not maintained between elements of non-linear data structure examples include trees and graphs supports variety of data structures we will now introduce all these data structures and they would be discussed in detail in subsequent arrays an array is collection of similar data elements these data elements have the same data type the elements of the array are stored in consecutive memory locations and are referenced by an index (also known as the subscriptin carrays are declared using the following syntaxtype name[size]for exampleint marks[ ]the above statement declares an array marks that contains elements in cthe array index starts from zero this means that the array marks will contain elements in all the first element will be stored in marks[ ]second element in marks[ ]so on and so forth thereforethe last elementthat is the th elementwill be stored in marks[ in the memorythe array will be stored as shown in fig st nd rd th th th th th th th element element element element element element element element element element marks[ marks[ marks[ marks[ marks[ marks[ marks[ marks[ marks[ marks[ figure memory representation of an array of elements arrays are generally used when we want to store large amount of similar type of data but they have the following limitationsarrays are of fixed size data elements are stored in contiguous memory locations which may not be always available insertion and deletion of elements can be problematic because of shifting of elements from their positions howeverthese limitations can be solved by using linked lists we will discuss more about arrays in linked lists linked list is very flexibledynamic data structure in which elements (called nodesform sequential list in contrast to static arraysa programmer need not worry about how many elements will be stored in the linked list this feature enables the programmers to write robust programs which require less maintenance in linked listeach node is allocated space as it is added to the list every node in the list points to the next node in the list thereforein linked listevery node contains the following two types of datathe value of the node or any other data that corresponds to that node pointer or link to the next node in the list