19.1 Fill in the blanks in each of the following:

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

2. The               operator is used to dynamically allocate memory and construct an object; this operator returns a pointer to the object.

3. 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 and node values are returned in last-in, first-out order.

4. A function that does not alter a linked list, but looks at the list to determine whether it’s empty, is an example of a(n)               function.

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

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

7. The               operator is used to destroy an object and release dynamically allocated memory.

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

9. A(n)               is a nonlinear, two-dimensional data structure that contains nodes with two or more links.

10. A stack is referred to as a(n)               data structure, because the last node inserted is the first node removed.

11. The nodes of a(n)               tree contain two link members.

12. The first node of a tree is the               node.

13. Each link in a tree node points to a(n)               or               of that node.

14. A tree node that has no children is called a(n)               node.

15. The four traversal algorithms we mentioned in the text for binary search trees are              ,              ,               and              .