In a function template, the programmer substitutes ________ for ________.

Members of a(n) ________ union have names, but the union itself has no name.

With a hollow structure, the organization ____.

With a(n) ____, you perform an action or task, and then you perform the next action, in order.

You can use either a(n) ____ or a ____ to store the value of a logical expression.

In a(n) ____________________ data type, each data item is a collection of other data items.

Which starts with an empty list and adds elements one-by-one to create a sorted list?

Minimum number of queues needed to implement the priority queue?

What is the most suitable data structure for a situation where tasks must be scheduled for execution on a computer and the tasks include system tasks?

Can a binary tree be implemented using an array?

What is the process a procedure goes through when one of the steps of the procedure involves invoking the procedure itself?