59 - TOWERS OF HANOI PROBLEM - C PROGRAMMING

TOWERS OF HANOI If n=1 then move the disk from source to destination If no. of disks greater than 1 then Move n-1 disks from source to auxiliary with the help of destination. Move the last disk from source to destination. Move n-1 disks from auxiliary to destination with the help of source.