Exam 18: Linked Lists

The last node in a linked list points to

To insert a new node in ascending order into a list, the list must be

Appending a node means adding it to the end of a list, and __________ a node means putting a new node in the list, but not necessarily at the end.

When you create a linked list you must know in advance how many nodes the list will contain.

Select all that apply. Variations of the linked list are

A list that contains pointers to the previous node, the next node, and a node in the third dimension is known as a triple linked list.

Deleting an entire list simply requires the use of the delete operator.

Nodes in a linked list are stored in contiguous memory.

The list container provided by the Standard Template Library is a template version of a

If new data needs to be added to a linked list, the program simply __________ and inserts it into the series.

The advantage a linked list has over a vector is that

If there are no nodes in a linked list, you cannot append a node to the list.

To create a linked list you must first create a(n)

A linked list class must take care of removing the dynamically allocated nodes and this is done by

To delete an entire list, normally you must traverse the list, deleting each node, one by one.

Select all that apply. Which of the following is a basic list operation?

To append a node to a list means to

The Standard Template Library (STL) provides a linked list container.

When working with a linked list one of the basic operations you can perform is to destroy the list.

Which type of list does not contain a null pointer at the end of the list?