21.1  Fill in the blanks in each of the following:
A self_____ class is used to form dynamic data structures that can grow and shrink at execution time The _____ operator is used to dynamically allocate memory and construct an object; this operator returns a pointer to the object. 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 lastin, firstout order. A function that does not alter a linked list, but looks at the list to determine whether it is empty, is an example of a(n)_____ function. A queue is referred to as a(n)_____ data structure, because the first nodes inserted are the first nodes removed. The pointer to the next node in a linked list is referred to as a(n) _____. The _____ operator is used to destroy an object and release dynamically allocated memory. 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. A(n) _____ is a nonlinear, twodimensional data structure that contains nodes with two or more links. A stack is referred to as a(n)_____ data structure, because the last node inserted is the first node removed. The nodes of a(n)_____ tree contain two link members. The first node of a tree is the _____ node. Each link in a tree node points to a(n) _____ or _____ of that node. A tree node that has no children is called a(n) _____ node. The four traversal algorithms we mentioned in the text for binary search trees are _____, _____, _____ and ______.
