(4) X + Y (3%)

(2) There are a linked list called List with two parts (data part and link part) and two pointers, pre (for previous) and cur (for current). Additionally, search is an algorithm that searches for a node with a specific value in List. If the node is found, it returns true; otherwise, it returns false. When the search stops, no matter whether the target is found, cur points to the node that stops the search and pre points to the previous node. At the beginning of the search, pre pointer is null and cur pointer points to the first node of List. If the flag returned from search is false (i.e., the node is not found), we can insert a node in List. Please show the algorithm that can be used to insert a node in List. (15%)

題組內容

(4) X + Y (3%)

相關申論題

相關試卷