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.

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

A static queue can be implemented as a ________.

To build a linked list, we can ________.

A stack that is implemented as a linked list is known as a deque.

Write a function   ListNode  * ListConcat(ListNode * list1, ListNode *list2)   That concatenates the items in list2 to the end of list1 and returns the resulting list.