Exam 17: Linked Lists

Every node in a doubly linked list has two pointers: ____ and ____.

The ____________________ operator advances the iterator to the next node in the linked list.

A doubly linked list can be traversed in either direction.

In C++, the dereferencing operator is ____________________.

A linked list is a random access data structure.

The ____________________ constructor executes when an object is declared and initialized using another object.

A linked list is a collection of components, called ____.

In a linked list, the order of the nodes is determined by the address, called the ____, stored in each node.

For classes that include pointer data members, the assignment operator must be explicitly ____________________.

The length of a linked list is the number of nodes in the list.

You can use the pointer head of a linked list to traverse the list.

Suppose that the pointer head points to the first node in the list, and the link of the last node is nullptr. The first node of the linked list contains the address of the ____ node.

When building a linked list in the ____ manner, a new node is always inserted at the end of the linked list.

A(n) ____________________ linked list is a linked list in which every node has a next pointer and a back pointer.

In a linked list, the address of the first node in the list is stored in a separate location, called the ____ or first.

Every node (except of the last node) in a singly linked list contains ____.

How many pointers are needed to build a linked list in a backward manner?

In a linked list, if a new item is always inserted at the beginning or at the end of the list and the data we read is unsorted, the linked list will be unsorted.

When you build a linked list in the backward manner, a new node is always inserted at the end of the linked list.

Consider the following code which deletes all the nodes in a linked list. Which of the following is the missing statement?