Consider the linked list shown in Figure 16-50. Assume that the nodes are in the usual info-link form. Use this list to answer Exercises 6 through 14. If necessary, declare additional variables. (Assume that list, current, temp, trail, and last are pointers of type nodeType.)
What is the output of the following C++ code?
a. while (current != NULL)
cout << current->info << " ";
current = current->link;
cout << endl;
b. while (current != last)
current = current->link;
cout << current->info << " ";
cout << endl;
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.