Java How to Program, Early Objects, 11th Edition

Self-Review Exercises

1. 21.1 Fill in the blanks in each of the following statements:

   1. A self-                 class is used to form dynamic data structures that can grow and shrink at execution time.

   2. A(n)                  is a constrained version of a linked list in which nodes can be inserted and deleted only from the start of the list.

   3. A method that does not alter a linked list, but simply looks at it to determine whether it’s empty, is referred to as a(n)                  method.

   4. A queue is referred to as a(n)                  data structure because the first nodes inserted are the first ones removed.

   5. The reference to the next node in a linked list is referred to as a(n)                 .

   6. Automatically reclaiming dynamically allocated ...