Data Structures and Algorithm Analysis - Computer Science at ...

Sec. 4.6 Exercises 139(b) L2.append(10);L2.append(20);L2.append(15);L2.moveToStart();L2.insert(39);L2.next();L2.insert(12);4.3 Write a series of Java statements that uses the List ADT of Figure 4.1 tocreate a list capable of holding twenty elements and which actually stores thelist with the following configuration:〈 2, 23 | 15, 5, 9 〉.4.4 Using the list ADT of Figure 4.1, write a function to interchange the currentelement and the one following it.4.5 In the linked list implementation presented in Section 4.1.2, the current positionis implemented using a pointer to the element ahead of the logicalcurrent node. The more “natural” approach might seem to be to have currpoint directly to the node containing the current element. However, if thiswas done, then the pointer of the node preceding the current one cannot beupdated properly because there is no access to this node from curr. Analternative is to add a new node after the current element, copy the value ofthe current element to this new node, and then insert the new value into theold current node.(a) What happens if curr is at the end of the list already? Is there still away to make this work? Is the resulting code simpler or more complexthan the implementation of Section 4.1.2?(b) Will deletion always work in constant time if curr points directly tothe current node? In particular, can you make several deletions in arow?4.6 Add to the LList class implementation a member function to reverse theorder of the elements on the list. Your algorithm should run in Θ(n) time fora list of n elements.4.7 Write a function to merge two linked lists. The input lists have their elementsin sorted order, from lowest to highest. The output list should also be sortedfrom lowest to highest. Your algorithm should run in linear time on the lengthof the output list.4.8 A circular linked list is one in which the next field for the last link nodeof the list points to the first link node of the list. This can be useful whenyou wish to have a relative positioning for elements, but no concept of anabsolute first or last position.