Assuming a linked list of n nodes, the C++ statements

Question

Node *cur = head;
while (cur != null) {
cout << curr->item << endl;
cur = cur->next;
} // end while
perform ______ write operations.

a. n
b. n – 1
c. n + 1
d. 1

Answer 1

a. n