structures thusit acts as building block to implement data structures such as stacksqueuesand their variations linked list can be perceived as train or sequence of nodes in which each node contains one or more data fields and pointer to the next node start figure simple linked list in fig we can see linked list in which every node contains two partsan integer and pointer to the next node the left part of the node which contains data may include simple data typean arrayor structure the right part of the node contains pointer to the next node (or address of the next node in sequencethe last node will have no next node connected to itso it will store special value called null in fig the null pointer is represented by while programmingwe usually define null as - hencea null pointer denotes the end of the list since in linked listevery node contains pointer to another node which is of the same typeit is also called self-referential data type linked lists contain pointer variable start that stores the address of the first node in the list we can traverse the entire list using start which contains the address of the first nodethe next part of the first node in turn stores the address of its succeeding node using this techniquethe individual nodes of the list will form chain of nodes if start nullthen the linked list is empty and contains no nodes in cwe can implement linked list using the following codestruct node int datastruct node *next}note linked lists provide an efficient way of storing related data and perform basic operations such as insertiondeletionand updation of information at the cost of extra space required for storing address of the next node start data next - figure start pointing to the first element of the linked list in the memory let us see how linked list is maintained in the memory in order to form linked listwe need structure called node which has two fieldsdata and next data will store the information part and next will store the address of the next node in sequence consider fig in the figurewe can see that the variable start is used to store the address of the first node herein this examplestart so the first data is stored at address which is the corresponding next stores the address of the next nodewhich is sowe will look at address to fetch the next data item the second data element obtained from address is againwe see the corresponding next to go to the next node from the entry in the nextwe get the next addressthat is and fetch as the data we repeat this procedure until we reach position where the next entry contains - or nullas this