SUMMARY: In computer science, a linked list is a data structure that consists of a sequence of data records such that in each record there is a field that contains a reference (i.e., a link) to the next record in the sequence.
A linked list is a data structure in which it contains the nodes. a node is a structure it contains the data field and a pointer field. the data field can be anything, and the pointer field contains the address of the next node.
so the structure should be
char name;// data
int rollno;// data
float fee;// data
struct Single_Linked_List *next;// pointer to the next node
typedef struct Single_Linked_List SLL;
now SLL can be used whereever structure can be used.