Exam 17: Linked Lists

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.

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

A linked list is a series of connected ________.

To create a linked list, you must first create a(n)________.

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

If the head pointer points to nullptr, this indicates ________.

A linked list is called "linked" because each node in the series has a pointer that points to the next node in the list.

The process of moving through a linked list is referred to as ________ the list.

Which of the following is a basic linked list operation?

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

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

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

Nodes in a linked list are stored in contiguous memory.

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

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

A new node cannot become the first node in the list.

Linked lists are less complex to code and manage than arrays.

The last node in a linked list points to ________.

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

Variations of the linked list are: