Java How to Program, Early Objects, 11th Edition

Answers to Self-Review Exercises

1. 21.1

   1. referential.

   2. stack.

   3. predicate.

   4. first-in, first-out (FIFO).

   5. link.

   6. garbage collection.

   7. queue.

   8. tree.

   9. last-in, first-out (LIFO).

   10. binary.

   11. root.

   12. child or subtree.

   13. leaf.

   14. inorder, preorder, postorder.

   15. -d.

   16. class loader.

   17. -classpath or -cp, CLASSPATH.

   18. package declaration.

2. 21.2 It’s possible to insert a node anywhere and remove a node from anywhere in a linked list. Nodes in a stack may be inserted only at the top of the stack and removed only from the top.

3. 21.3 A queue is a FIFO data structure—nodes may be inserted at the tail and deleted from the head. A stack is a LIFO data structure that has a single reference to the stack’s top, where both insertion and deletion of nodes are performed.