Tower of Hanoi in Data Structures using Java

Program 1

// Program for tower of Hanoi
import java.util.*;
class Tower
{
    public static void main(String args[])
    {
        int n;
        Scanner scan=new Scanner(System.in);
        System.out.println("Enter Number of disk");
        n=scan.nextInt();
        move(n,'A','B','C');                                                                           
    }
    public static void move(int n,char a,char b,char c)
    {
            if(n==1)
             System.out.println("Move disk " + n + " from " + a + " to " + c);
            else
            {
                   move(n-1,a,c,b);
                   System.out.println("Move disk " + n + " from " + a + " to " + c);
                   move(n-1,b,a,c);
            }
    }
}