Q1004
The time complexity of the solution tower of hanoi problem using recursion is . . . . . . . .
A.
O(n2)
B.
O(2n)
AnswerC.
O(n log n)
D.
O(n)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board