19.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 last-in, first-out order.
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.
A queue is referred to as a(n) data structure, because the first nodes ...