the matrix howeveras in case of doubly linked listswe can also have corresponding inverse pointer for every pointer in the multi-linked list representation of sparse matrix note when non-zero value in the sparse matrix is set to zerothe corresponding node in the multi-linked list must be deleted ( null null null co-ordinate ( data value ( null null next in column ( null null next in row figure multi-linked representation of sparse matrix shown in fig applications of linked lists linked lists can be used to represent polynomials and the different operations that can be performed on them in this sectionwe will see how polynomials are represented in the memory using linked lists polynomial representation let us see how polynomial is represented in the memory using linked list consider polynomial every individual term in polynomial consists of two partsa coefficient and power here and are the coefficients of the terms that have and as their powers respectively every term of polynomial can be represented as node of the linked list figure shows the linked representation of the terms of the above polynomial figure linked representation of polynomial now that we know how polynomials are represented using nodes of linked listlet us write program to perform operations on polynomials