A matrix can be stored as Linked Lists as demonstrated in the following example. Each Node of a

linked list represents a non$-$zero entry of the matrix and contains the row index, column index,

data value, and pointers to the next non$-$zero entry to its right $($if any$)$ in the same row and the

next non$-$zero entry $($if any$)$ below it in the same column For example, the matrix $[[0,0,1,0,0],$

$[0,0,0,0,0],[0,1,0,0,1],[0,0,0,1,0]]$ can be stored as two Arrays of Linked Lists as shown below: