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) ________.

When using a node pointer to traverse a linked list, we know we have reached the end of a list when ________.

Which of the following is NOT a Linked List Container?

Queues that are implemented as arrays are called ________ queues.

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

A ________ is processed in a manner similar to customers standing in a grocery check-out line: The first customer in line is the first served.

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

A ________ is a double-ended queue.