Exam 16: Linked Lists

In C++,the dereferencing operator is represented by the ____________________ symbol.

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?

Linked lists allow you to overcome the size limitations of an array data type.

The nodes of a standard ordered list (as constructed in the text)are in ____________________ order.

If a formal parameter is a value parameter,the ____________________ constructor provides the formal parameter with its own copy of the data.

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

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

Data can be organized and processed sequentially using an array called a(n)____ list.

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