An alternative to the deletion strategy we have given is to use lazy deletion. Todelete
Chapter 3, Problem 3.20(choose chapter or problem)
An alternative to the deletion strategy we have given is to use lazy deletion. Todelete an element, we merely mark it deleted (using an extra bit field). The numberof deleted and nondeleted elements in the list is kept as part of the data structure. Ifthere are as many deleted elements as nondeleted elements, we traverse the entirelist, 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 lazydeletion.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer