I have to solve a data structure fiction problem that involves reversing a linked list, but how can I invert a list if I do not have the elements of it (Less of course p-start and p-> end) follows the code
%pre%I have to solve a data structure fiction problem that involves reversing a linked list, but how can I invert a list if I do not have the elements of it (Less of course p-start and p-> end) follows the code
%pre%The first function reverses the list elements and the second function reverses the start and end reference.
%pre%