Career Tracks
Exams
MCQ
Companies
Opportunities
Challenges
Pricing
MCQ Practice
Data Structures
Recursion & Backtracking
Question
Medium
tcs-nqt
Tower of Hanoi with n disks requires how many moves?
A
n
B
2n
C
2^n - 1
D
n²
Show Answer
← Back to Recursion & Backtracking questions
Tower of Hanoi with n disks requires how many moves? | Recursion & Backtracking MCQ | TomoLink | TomoLink
