Understanding insertion at a given distance

We have learned how to perform this operation on a singly linked list. However, a doubly linked list does not offer any specific advantage in this case because we don’t know the exact address of the node where we want to insert the new node, so we will have to traverse the list anyway. On the downside, it adds some extra complexity as now we also need to update the previous pointer of some nodes. Let’s look at all the cases we need to consider.

1. If the list is empty and X > 0

Attempting to insert a node at a position greater than 0 in an empty list is an invalid operation. In an empty list, no nodes are present, so the only valid position for insertion would be at position 0, making the new node the head of the list. However, when X is greater than 0, no corresponding position is available for insertion because the list lacks any elements. Therefore, we will return the existing head.