Define Tower of Hanoi . Explain algorithm for Tower of Hanoi ? 


==> Tower of Hanoi--

  • Tower of Hanoi, is a mathematical puzzle which consists of three tower (pegs) and more than one rings
  • These rings are of different sizes and stacked upon in ascending order i.e. the smaller one sits over the larger one. There are other variations of puzzle where the number of disks increase, but the tower count remains the same.


Share to whatsapp

More Questions from Data Structures and Algorithms Module 2

Explain Dequeues- Double Ended Queues ? 


View

Define Evaluation of Postfix expression. Explain algorithm and example for it ? 


View

Explain Algorithm for Enqueue operation  and Algorithm for Dequeue operation using array ? 


View

Explain about Implementation of Queue ? 


View

Explain Multiple stacks ?


View

Define stacks . Explain implementation of stacks ? 


View

Define Queue. Explain Basic features of Queue ? 


View