Generally we don't have a pointer to the node after which we wish to insert a new node, which is given to us here. Without this pointer the time complexity becomes $O(n)$ because the worst case is end-of-list insertion. With it, the time becomes $O(1)$.