Exam 17: Linked Lists

A linked list class must take care of removing the dynamically allocated nodes. This is done by ________________.

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

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

A linked list is a series of connected _______.

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

ADT stands for:

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

An insertion or deletion routine requires that you create this many pointers for use during the traversal process.

This type of list does not contain a NULL pointer at the end of the list.

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

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

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

Nodes in a linked list are stored in contiguous memory.

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

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

To append a node to a list means to ___________.

Variations of the linked list are:

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

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.

To build a list initially, you can use a(n) ________________ routine.