linked structures reference to point to the new node if the two nodes are not aliasesthen the node is inserted by setting the next field of the node referenced by prednode to point to the new node this step is handled by lines - of listing traversing and deleting the traversal operation implemented for the unsorted linked list can be used with both sorted and unsorted linked lists since it is not dependent on the contents of the list itself deleting from sorted linked list is the same operation used with an unsorted list with one exception searching for the node containing the target value can end early after encountering the first value larger than the one to be deleted the sparse matrix revisited in the previous we defined and implemented the sparse matrix adt remembera sparse matrix is matrix containing large number of zero elements instead of providing space for every element in the matrixwe need only store the non-zero elements in our original implementationwe used list to store the nonzero elements of the matrixwhich were stored as matrixelement objects this improved the time-complexity of many of the matrix operations when compared to the use of - array we can further improve the sparse matrix adt by using the linked list structure instead of storing the elements in single listhoweverwe can use an array of sorted linked listsone for each row of the matrix the non-zero elements for given row will be stored in the corresponding linked list sorted by column index the row index is not needed since it corresponds to specific linked list within the array of linked lists the sparse matrix from figure is illustrated in figure stored using an array of linked lists listofrows numcols sparsematrix col value next matrixelementnode figure sparse matrix implemented as an array of sorted linked lists