data structures using multi-linked lists in multi-linked listeach node can have number of pointers to other nodes doubly linked list is special case of multi-linked lists howeverunlike doubly linked listsnodes in multilinked list may or may not have inverses for each pointer we can differentiate doubly linked list from multi-linked list in two ways(aa doubly linked list has exactly two pointers one pointer points to the previous node and the other points to the next node but node in the multi-linked list can have any number of pointers (bin doubly linked listpointers are exact inverses of each otheri for every pointer which points to previous node there is pointer which points to the next node this is not true for multi-linked list multi-linked lists are generally used to organize multiple orders of one set of elements for exampleif we have linked list that stores name and marks obtained by students in classthen we can organize the nodes of the list in two ways(iorganize the nodes alphabetically (according to the name(iiorganize the nodes according to decreasing order of marks so that the information of student who got highest marks comes before other students figure shows multi-linked list in which studentsnodes are organized by both the aforementioned ways advik goransh dev saisha null zara null figure multi-linked list that stores names alphabetically as well as according to decreasing order of marks new node can be inserted in multi-linked list in the same way as it is done for doubly linked list note in multi-linked listswe can have inverses of each pointer as in doubly linked list but for that we must have four pointers in single node figure sparse matrix multi-linked lists are also used to store sparse matrices in we have read about sparse matrices such matrices have very few non-zero values stored and most of the entries are zero sparse matrices are very common in engineering applications if we use normal array to store such matriceswe will end up wasting lot of space thereforea better solution is to represent these matrices using multi-linked lists the sparse matrix shown in fig can be represented using linked list for every row and column since value is in exactly one row and one columnit will appear in both lists exactly once node in the multi-linked will have four parts first stores the datasecond stores pointer to the next node in the rowthird stores pointer to the next node in the columnand the fourth stores the coordinates or the row and column number in which the data appears in