Exam 17: Linked Lists

The steps involved in inserting a new item at the beginning of an unordered linked list are ____.

In C++, the dereferencing operator is ____________________.

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

A linked list must be searched ____________________, starting from the first node.

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

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

A(n) ____________________ is an object that produces each element of a container, such as a linked list, one element at a time.

What is the purpose of the following code? current = head; While (current != NULL) { //Process current Current = current->link; }

Because each node of a linked list has two components, we need to declare each node as a(n) ____.

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