REVRSE:Bhagalpur Sir

write a code to reverse a linked list
1)iterative
2)recursive
3)neither iterative nor recursive

iska koi solution do yaar mast sa .... (3) wale ka

Sir aap vo a xor b vaale ki to baat nahi kar rahe.....

During the construction of the linked list instead of the next pointer we can store
prev_pointer (xor) next_pointer

after the construction we will store the first_pointer as the head and last_pointer pointing to the last node...
the code for reversing will be:

temp=first_ponter;
first_pointer=last_pointer;
last_pointer=temp;

are sir kam se kam 1 baar to traverse karna hi padega reverse karne ke liye. o(1) mein kaise possible hai

I also think of the above solution only.

Traverse the list once in forward direction. Now when u will reach the end, from here start traversing back removing the address of previous node from each node.