Vidyalelo
Data Structure · Q74

Stacks in Data Structures

Programming · Data Structure · question 74

Q74

What is the number of moves required to solve Tower of Hanoi problem for k disks?

A.
2k - 1
B.
2k + 1
C.
2k + 1
D.
2k - 1
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board