Stacks are useful data structures for algorithms that work with lists of items in a ________.

Suppose the following operations are performed on an empty queue:   enqueue(5); enqueue(7); dequeue(); enqueue(9); enqueue(12); dequeue(); enqueue(10);   Insert numbers in the following diagram to show what will be stored in the static queue after the operations have executed.           Front                                              Rear                     *Write your answer in the text box as they would appear in the diagram. For example:   5    4     –    2   Where 5 is at the front, the – is an empty space in the diagram and 2 is at the rear*

If the head pointer points to NULL, it is an indication that ________.

Push and pop are the two most common queue operations.

The programmer must declare in advance the size of a dynamic stack or queue.

A ________ is a container that provides quick access to elements at the front and the back of the list.

Static stacks have a ________ size, and are implemented using ________.

A dynamic stack has a ________ size, and is implemented as a(n) ________.

If a node is not the first node in a linked list, deleting it may require setting the successor pointer in its predecessor.

The ________ of a linked list points to the first node in the list.