Java™ How to Program, Seventh Edition

Answers to Self-Review Exercises

17.1	referential. stack. predicate. first-in, first-out (FIFO). link. garbage collection. queue. tree last-in, first-out (LIFO). binary. root. child or subtree. leaf. inorder, preorder, postorder. auto-unboxing. autoboxing.
17.2	It is possible to insert a node anywhere in a linked list 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.
17.3	A queue is a FIFO data structure that has references to both its head and its tail, so that 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.
17.4	Classes ...