Exam 16: Linked Lists

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

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

Each node of a linked list must store the data as well as the ____________________ for the next node in the list.

The link field of the last node of a linked list is ____.

The ____ deallocates the memory occupied by the nodes of a list when the class object goes out of scope.

A linked list is a random access data structure.

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

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

struct nodeType { $\quad$ int info; $\quad$ nodeType *link; }; nodeType *head, *p, *q, *newNode; newNode = new nodeType; -Consider the accompanying code.What is the effect of the following statement? newNode->info = 50;

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

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

template <class Type> ____ doublyLinkedList<Type>::isEmptyList() const { $\quad$ return (first == NULL); } -Consider the accompanying statements.The operation returns true if the list is empty; otherwise,it returns false.The missing code is ____.

Memory for the components of an array does not need to be contiguous.

Consider the following code: template <class Type> Int doublyLinkedList<Type>::length()const { ____ } The statement that provides the length of the linked list is ____.

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

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

A linked list in which the last node points to the first node is called a(n)____________________ linked list.

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

Each node of a singly linked list has two components: ____ and ____.

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