Vidyalelo
Data Structure · Q1104

Miscellaneous on Data Structures

Programming · Data Structure · question 1104

Q1104

Recurrence equation formed for the tower of hanoi problem is given by . . . . . . . .

A.
T(n) = 2T(n-1)+n
B.
T(n) = 2T(n/2)+c
C.
T(n) = 2T(n-1)+c
Answer
D.
T(n) = 2T(n/2)+n

Answer: Option C

Solution

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