Question
What is the number of moves required in the Tower of Hanoi problem for k disks?
Answer: Option A
Was this answer helpful ?
Tracing of the moves in the above ToH problem will prove this result, instead you can simply add a count for each recursive call to check the number of moves.
Was this answer helpful ?
More Questions on This Topic :
Latest Videos
Latest Test Papers
Submit Solution