In an array A[n] of size n we can access the element A[n+1] by writting *(A+n+1) . Accessing the all the elements before and after the index can be done in 0(1) time complexity.So, why we will use a linked list if we can access any no of elements after the end point of an array . The size of each node is also larger in case of linked list.