Yes, Let us assume the position is 4 at which node 21 is to be inserted. You will now have to traverse till 4-1 th node is the 3rd node. As you reach the 3rd node, you should allocate memory for the new node, which needs to be added, then point the next of the new node to the next of the current node, then point the next of the current node to the new node. In between, you should also check whether the position given as input is valid or not, as it should be greater than 1 and also must not exceed the total number of nodes.