if index found delete that node
if ( index == count ) { previous -> next = next -> next ; free ( next ) ; return ; } previous = previous -> next ; next = previous -> next ; len -- ; count ++ ; } return ; }