A ________ stack or queue is implemented using linked lists.

A dynamic stack may be implemented as a(n) ________, and expand or shrink with each push or pop operation.

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

The statement stack< int, vector > iStack; creates ________.

A static queue can be implemented as a ________.

To build a linked list, we can ________.

A(n) ________ is an abstract data type that stores and retrieves items in a last-in-first-out manner.

A dynamic queue can be implemented as a(n) ________.

The pop function in the stack template of the STL does not return the value from the top of the stack.