Question

Implement a singly linked list having all unique elements with the following operations • 10r-Inserts element z at the end. • I1ya-If the element y exists, then insert element z after the element y, else insert element y before the existing element Assuming either the element or the element y exists. • 12 zya - Inserts element in the middle of the elements z and y. The element z appears before the element y U x p-Links the next pointer of the element a to the node lying at the ph position from the element a while traversing towards right In case of insufficient number of nodes, the counting continues by updating the existing linked list to its circular version

Answer 1

Explanation:

kjghjkugj said if 7NCAA 7of the uv