A dynamic stack starts as an empty linked list.

In a dequeue operation, the element at the ________ of the queue is removed.

A ________ is used to step through a linked list and search for data.

A new node must always be made the last node in the list.

A stack has two primary operations called ________.

For most people, ________ queues are more intuitive and easier to understand than ________ queues.

Inserting an item into a linked list requires that all the items past the point of the insertion be shifted to make room for the new item.

The ________ operation allows an item to be stored on a stack.

The queue data structure is commonly applied in connection with ________.

A queue is a data structure that stores and retrieves items in a ________ manner.