If k is zero or k is equal to size or k is a multiple of size of sublist then list remains intact
if ( k == 0 k == size ) { ListNode * head = A ; while ( head != NULL ) { cout << head -> data ; head = head -> next ; } return ; }