The number in parentheses at the end of an exercise refers to the learning objective lis...

The number in parentheses at the end of an exercise refers to the learning objective listed at the beginning of the chapter.

Mark the following statements as true or false.

a. Every node in a linked list has two components: one to store the relevant information and one to store the address. (1)

b. In a linked list, the order of the elements is determined by the order in which the nodes were created to store the elements. (1)

c. In a linked list, memory allocated for the nodes is sequential. (1, 2)

d. In a linked list, typically, the link field of the last node points to itself. (1, 2)

e. Suppose the nodes of a linked list are in the usual info-link form and current points to a node of the linked list.Then current=current.link; advances current to the next node in the linked list. (2)

f. To insert a new item in a linked list, create a node, store the new item in the node, and insert the node in the linked list. (3)

g. To build a linked list forward, the new node is inserted at the end of the list. (4)

h. A single linked list can be traversed in either direction. (2, 4, 5)

i. In a linked list, nodes are always inserted either at the beginning or the end because a linked list is not a random-access data structure. (4, 5, 8, 9)

j. The head pointer of a linked list should not be used to traverse the list. (2, 4, 7)

k. The two most common operations on iterators are ++ and * (the dereferencing operator). (6)

l. The function initializeList of the class linkedListType initializes the list by only setting the pointers first and last to nullptr. (7)

m. The function search of the class unorderedLinkedList searches the linked list sequentially, while the function search of the class orderedLinkedList searches the list using a binary search algorithm because the data in an orderedLinkedList object is sorted. (8, 9)

n. A doubly linked list can be traversed in either direction. (10)