We will first check if the ‘head’ is NULL or not. The next part after the creation of a node is to join the nodes and create the linked list. Tmp->next=NULL – We have given the value to ‘data’ in the previous line and a value of the pointer ‘next’ (NULL) in this line and thus making our node ‘tmp’ complete. Tmp->data = n – We are giving a value to the ‘data’ of ‘tmp’ as passed to the function. Now, ‘tmp’ points to a node (or space allocated for the node). Node *tmp=new node – We are allocating the space required for a node by the new operator. If you are not familiar with the ‘malloc’ function, then just read the dynamic memory allocation chapter. #include using namespace std struct node The first part is to create a node (structure). You are now clear with the concepts of a linked list. One thing you should notice here is that we can easily access the next node but there is no way of accessing the previous node and this is the limitation of singly linked list. For example, if ‘a’ is a node then a->next is the node next to the ‘a’ (the pointer storing the address of the next node is named ‘next’). So, if we have access to the first node then we can access any node of the linked list. The picture representing the above structure is given below.Īnd the picture representing the linked list is: This means that the second data member holds the address of the next node and in this way, every node is connected as represented in the picture above. The first data member of the structure (named node) is an integer to hold an integer and the second data member is the pointer to a node (same structure).
This pointer holds the address of the next node and creates the link between two nodes.
Each structure represents a node having some data and also a pointer to another structure of the same kind. In C++, we achieve this functionality by using structures and pointers. Notice that the last node doesn’t point to any other node and just stores NULL. Here, each node contains a data member (the upper part of the picture) and link to another node(lower part of the picture). It is similar to the picture given below. Every node is mainly divided into two parts, one part holds the data and the other part is connected to a different node. You can also practice a good number of questions from practice section.Ī linked list is made up of many nodes which are connected in nature. You can go through the pointers chapter if you don’t have a strong grip over it. The implementation of a linked list in C++ is done using pointers. Linked lists are very useful in this type of situations. We often face situations, where the data is dynamic in nature and number of data can’t be predicted or the number of data keeps changing during program execution. Linked list is one of the most important data structures.
0 kommentar(er)
