How to write an actual algorithm for inserting an element in a linked list?

Insert newNode into a linked list after targetNode

Node currentNode = root

while currentNode != targetNode

currentNode = currentNode.next

newNode.next = currentNode.next

currentNode.next = newNode