An alternative way to the deletion strategy in linked list is to use lazy deletion. To delete an element, we merely mark it deleted (using an extra field in the node). The number of deleted and non-deleted elements in the list has to be maintained in the head node (maybe head node has different structure than normal data nodes to store this information). If there are as many deleted elements as non-deleted elements, we traverse the entire list, performing the standard deletion algorithm on all marked nodes. Design routines to implement the standard linked list operations using lazy deletion.(Design efficient ADT, so that the memory can not be wasted in the head node and data nodes).

prize reward is $20 for solving this question. Prize will be rewarded in the Form of Harmony One Token....Please write the code in C laguage

Question

An  alternative  way  to  the  deletion  strategy  in linked list   is  to  use lazy deletion.  To  delete  an  element,  we  merely  mark  it  deleted  (using  an  extra field in the node). The number of deleted and non-deleted elements in the list has  to  be  maintained  in  the  head  node (maybe head  node has  different structure  than  normal  data  nodes to  store this  information). If  there  are  as many deleted elements as non-deleted elements, we traverse the entire list, performing  the  standard  deletion  algorithm  on  all  marked  nodes.  Design routines to implement the standard linked list operations using lazy deletion.(Design  efficient  ADT,  so  that  the  memory  can  not  be  wasted  in  the head node and data nodes).

prize reward is $20 for solving this question. Prize will be rewarded in the Form of Harmony One Token....Please write the code in C laguage

AquarytheALPHA · Answer

Hmmmmm can you explain this more is this for school?

Darfangel · Answer

@aquarythealpha wrote:

Hmmmmm can you explain this more is this for school?

Yes this is for school its computer science!