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.

Each node in a ________ list contains pointers to the nodes before and after it.

In many recursive operations on linked lists, ________.

A linked list class using dynamically allocated memory should free its memory when the list is destroyed. This can be done by ________.

Moving through a linked list is referred to as ________ the list.

Deleting an entire list requires traversing the list to delete the nodes.