Because prevPtr does not equal NULL, the else-clause is executed. The completed list is shown with the auxiliary variables removed.
Insert(100)
We do not repeat the first part of the search, but pick up the walk-through where prevPtr is pointing to the node whose component is 50, and currPtr is pointing to the node whose component is 90.
while (currPtr != NULL &&
item > currPtr->component)
prevPtr = currPtr;
currPtr = currPtr->link;
Because 100 is greater than 90, this expression is TRUE and the loop body is repeated.
