linkedlist

Every time we add nodes we allocate memory dynamically. When we no longer need the list or the program exits we must free the allocated memory. Not doing this might result in memory leaks. This short tutorial shows how to deallocate linked list. As in the other posts, this example is based on the linked … Read more

This tutorial’s topic is: delete node at position linked list. You will learn how to delete node at a position in a linked list. Depending on the position you give as argument, the delete operation needs to threat three cases: The node you want to delete is the last node. The node you want to … Read more

Following our last tutorial where we insert a node after a certain position, in this one we will learn how to insert node before specified position in a C linked list. As our previous lessons on this subject, the below function is meant to be used with the linked list example we did in the … Read more

This lesson shows how you can insert node after a certain position. This means your list must already be populated (non null). Check the first lesson on the linked list. It contains the rest of code such as list creation, struct definition etc. Insert Node after a Certain Position To insert node after a certain … Read more

Following the previous lesson, we will now see how you can add a new node at the beginning of a C linked list. The add node to beginning example we are using in this tutorial uses the linked list made in the first first lesson, so if you haven’t read it already, please check Linked … Read more

The linked list is one of simplest data structure after the array. Characteristics: It’s made up of elements and links; Elements can be of only one type; It can have any number of elements; It can be dynamically increased or decreased; Elements can be inserted anywhere: at the beginning, in the middle or at the … Read more