Question

Briefly explain the method you will use to execute an array linked list?

Answer 1

Linked list is the fundamental data structures in C and its knowledge is needed for C programmers.

Linked list generally contains memory blocks that are located at random memory locations.  

Now, one would ask how are they connected or how they can be traversed?  

Well, they are connected through pointers.  

Usually a block in a linked list is represented through a structure like this :

struct test_struct

{

   int val;

   struct test_struct *next;

};

This structure has a value ‘val’ and pointer to a framework of same type. The value ‘val’ can be any value while the pointer ‘next’ contains the address of next block of this linked list.

Answer 2

The procedure of accessing elements by means of  Array List is much faster as it is based on the index.

But to do it by means of  Linked List is tough because the process is slower.

The procedures of  Insertion and deletion is quite faster by means of  Linked List because the node changes the pointers before or after the post the nodes.

With Array List insertion or deletion is a slower process because these operations regulate the indexes by means of the deletion or insertion.