question 3.20 b part for c++

C Get Homework Help With C Get Homework Help With + - X a Assignment 0 cs210 textbook.pdf x C Write A Program Which o file:///C:/Users/ksimt/Desktop/cs210%20textbook.pdf E 137 of 654 Contents 3.18 3.19 - + Fit to width Page view A Read aloud Add notes A as suggested at the end of Section 3.5. When an erase method is applied to a list, it invalidates any iterator that is referencing the removed node. Such an iterator is called stale. Describe an efficient algorithm that guarantees that any operation on a stale iterator acts as though the iterator's current is nullptr. Note that there may be many stale iterators. You must explain which classes need to be rewritten in order to implement your algorithm. Rewrite the List class without using header and tail nodes and describe the differences between the class and the class provided in Section 3.5. An alternative to the deletion strategy we have given is to use lazy deletion. To delete an element, we merely mark it deleted (using an extra bit field). The number of deleted and nondeleted elements in the list is kept as part of the data structure. If there are as many deleted elements as nondeleted elements, we traverse the entire list, performing the standard deletion algorithm on all marked nodes. a. List the advantages and disadvantages of lazy deletion. b. Write routines to implement the standard linked list operations using lazy deletion. 3.20 A Ta (10) ENG 8:51 PM