[i_learn]

allright u haev a linked list.....u have to reverse the order, WITHOUT allocating more anymore memory......

eg:

first->5->10->15->20->25->NULL.

u have to get

25->20->15->10->5

Do not allocate memory......

this is up for discussion......coz i tried solving it...but we dont get our answer papers back....so i cant ever know if i was right!

[ryno]

reverse(listVals.begin(), listVals.end());

reverse will allocate some memory, of course. But I, the programmer, did not.

There really is no way to reverse that list without allocating any memory at all.