Exam 18: Linked Lists

A linked list is a series of connected

Select all that apply. A __________ list contains pointers to the nodes before it and after it.

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

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

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

A linked list can grow and shrink as a program runs.

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

Select all that apply. While traversing a list, a node pointer knows when it has reached the end of the list if

Select all that apply. Which of the following containers can add elements at their back without requiring traversal?

To build a list initally, you can use a(n) __________ routine.

In an insertion or deletion routine: How many pointers are you required to create for use during the traversal process?

If the head pointer points to nullptr, this indicates

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

The __________ of a linked list points to the first node in the list.

ADT stands for

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

When you delete a node from a list, you must ensure that the links in the list are not permanently broken.

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

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

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