C Program for Tower of hanoi problem
If u find it as best answer click on tank you and brainiest answer buttons
  • Brainly User
Only one disk can be moved at a time.Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.No disk may be placed on top of a smaller disk.