Self-Review Exercises

  1. 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 ...

Get C++ How to Program, 10/e now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.