16. Consider the graph in Figure 1(b). Starting with node S, what is the order of the nodes processed by the depth-first search? If two or more nodes can be chosen, choose the node with the smallest label first. (A) S-C-A-P-B-M-H-D-R；(B) S-M-H-C-A-P-B-D-R； (C)S-C- A-M-H-P-B-D-R；(D) S-C-R-A-M-H-P-B-D.

Note: There are 20 questions in total. Each one is 5 points. Please choose one answer for each question. No extra points will be deducted for wrong answers. 1. Suppose a node in a linked list A contains two fields, data and link, where link is the pointer to the following node. Let head-ptr be a pointer to the first node of A. Suppose we would like to traverse all the nodes of A by the loop "while (Ihead.ptr){B；}". What is B?(A) head. ptr == NULL； (B) head-pr = x(head-ptr) → link； (C) head-ptr = head-ptr -＞ link； (D) thead ptr = x(head_ptr) → link.

相關試題

相關試卷