The singly linked list exists and the node must be inserted // after the last node. temp = new Node(); temp.name = "C ... ELSE // Insert current element into the proper position in the nonempty ...

While singly-linked lists ... offer faster node insertion/deletion than equivalent array-based operations. Only links need to be updated after identifying the insert/delete position.