** Data Structures and Algorithms Using Java ** Chapter 4: Linked Lists and Iterators **

A. Suppose that when a node is added to a singly linked list, it becomes the new last node. Assuming the list header is named h, and the link field is named next, give the pseudocode algorithm for this approach to the Insert algorithm.

B.Give the dominant term in the speed function of the Insert algorithm described in the previous exercise.