## Which statement is correct in the case of Tower of Hanoi?

Answer: option 2. **only one disk can move at a time.**

## What is statement of Tower of Hanoi problem?

Initially, all the disks are placed on one rod, one over the other in ascending order of size similar to a cone-shaped tower. The objective of this problem is **to move the stack of disks from the initial rod to another rod**, following these rules: A disk cannot be placed on top of a smaller disk.

## What is the objective of Tower of Hanoi?

The objective of the game is **to move the entire stack to another rod, obeying the rules**: Only one disk may be moved at a time. Each move consists of taking the upper disk from one of the rods and sliding it onto another rod, on top of the other disks that may already be present on that rod.

## Which data structure can be used suitably to solve the Tower of Hanoi problem?

Explanation: The Tower of Hanoi involves moving of disks ‘stacked’ at one peg to another peg with respect to the size constraint. It is conveniently done using stacks and priority queues. **Stack approach** is widely used to solve Tower of Hanoi.

## Can you move all the disks to Tower C game?

Object of the **game** is to **move all the disks** over to **Tower** 3 (with your mouse). But **you** cannot place a larger **disk** onto a smaller **disk**.

## What is the time complexity of Tower of Hanoi problem?

The time complexity to find order of moves of discs in Tower of Hanoi problem is **O(2^n)**.