The following recursive function in C is a solution to the Towers of Hanoi…
PYQ GATE 2002
The following recursive function in C is a solution to the Towers of Hanoi problem.
Void move (int n, char A, char B, char C)
{
if (………………………………….) {
move (………………………………….);
printf(“Move disk %d from pole %c to pole %c\n”, n, A,C);
move (………………………………….);Fill in the dotted parts of the solution.
Sign up free to check your answer
Sign up freeLoading lesson…

