let   the towers be  x, y,   z

aim:  move n disks from x to y with its constraints using z.

1.   Suppose that we can move top n-1 disks from x to  z using y.

2.  move bottom disk to  y  form x.

3. move now using x,  n-1 disks from z to y.

This is the well known recursive algorithm.  Try programming for this first.

Then convert your program into recursive one.

I hope that this may partially answer your question

Please explain iterative algorithm of TOWER OF HANOI".

In the iterative version, the most popular solution is to use a "stack" to push and pop what would be the recursive calls. I have an example written in Java, I can send you if you want.

Please read the following line

    "Then convert your program into recursive one.""""

as  

    ""Then convert your program into iterative version by selecting a suitable data structure (may be as suggested by Eduardo Corrêa Gonçalves )  recursive one.

After this if you find it difficult  follow the suggestions of Eduardo Corrêa Gonçalves.  

@Eduardo Correa Goncalves

Yes sir. I need that JAVA code. Can u mail me on [email protected]