Help Me/Question How To Implement Circular Singly Link List?

steve taylor

White Belt
Linked list:-
It is collection of ordered data which is connected with its successor and its predecessor.
Singly Circular Linked List :-
Singly linked list become Circular linked list if we store header node address in the last note .
So last node point to the first node.
How to write C code to implement Circular singly linked list?