Question

Implement the following operations on a circular single linked list (list of Real
values) without header node after defining the node structure and initializing the list
to empty. (L is a pointer to last node.)
a) Search_Delete(L, X) to search for a node with the information X and delete
its successor's successor if exists. This function should return pointer to node
with the information X if exist and NULL otherwise

​

Answer 1

Answer:

right boro ..........

Answer 2

Explanation:

hshsgdgdhdbbdbebdhdbdjdhdh hdhdhdhdhdhhs,