Exam 17: Linked Lists

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

A doubly-linked list keeps track of the next node in the list, as well as:

Deleting an entire list requires traversing the list, deleting each node one by one.

In a circular-linked list, the last node points to the:

Deleting a node is a ______________ step process.

If the head pointer points to NULL, this indicates

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

A linked list can consist of structs, objects, or other abstract data types.

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

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

Which of the following is a basic linked list operation?

The advantage a linked list has over a vector is:

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

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

While traversing a list, a node pointer knows when it has reached the end of a list when:

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

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

A __________ list contains pointers to the nodes before it and after it.

A __________ is used to travel through a linked list and search for data.

The last node in a linked list points to ______.