Java Foundations

Figure 13.4

Figure 13.5

Explain what will happen if the steps depicted in Figure 13.4 are reversed.

Explain what will happen if the steps depicted in Figure 13.5 are reversed.

Write an algorithm for the add method that will add at the end of the list instead of at the beginning. What is the time complexity of this algorithm?

Modify the algorithm from the previous exercise so that it makes use of a rear reference. How does this affect the time complexity of this and the other operations?

Discuss the effect on all the operations if there were not a count variable in the implementation.

FIGURE 13.4 Inserting a node at the front of a linked list FIGURE 13.5 Deleting the first node in a linked list