Puedes seguirnos en



Singly Linked List: Creating and displaying multiple nodes

Singly linked list is a dynamically allocated list, which consists of one or more nodes. Each node contains a pointer which holds the address of the next node and an a data field, which holds the data of each node. Although singly linked list is used for saving space, it is quite complicated to implement and when it comes to inserting various nodes in the list it become even more complex.

In order to insert various nodes in the list, we are going to need two pointers. On of them should be loaded with the address of the first node, which should not be touched or manipulated. The other pointer should be used to traverse through the list for the perpous of inserting more than one node.

Displaying a singly linked list is quite simple as compared to inserting them. Here we will also need two pointer for the exact same perpous as of the insertion and a simple loop to traverse through each and every node while displaying the data.

Here is a video tutorial which explains the process of creating and displaying the nodes:

Anuncio publicitario

Escrito por

Administrador de ENGGDRCAOS. Canal dedicado especialmente a la formación del estudiante que aspira a ser ingeniero. Todos los videos son Ingles. Apasionado del universo Apple, estudiante de Ingeniería y Gamer por vocación.




Singly linked list is a type of list which uses dynamic representation rather than a much simpler and versatile static representation. Dynamic representation is...


Queue is a very useful data structure. Various features of operating system are implemented using queue. Scheduling of processes (Round Robin Algorithm) Spooling (to...


Maximum size of the queue is fixed at the time of compilation, when the queue is represented using an array, this causes wastage of...


The linked list consist of a series of structures. They are not required to be stored in adjacent memory locations. Each structure consist of...