Implement tower of hanoi using stack

// C program 
// Implement tower of hanoi using stack 
#include <stdio.h>
#include <stdlib.h>

// Define stack node
struct StackNode
{
	int disk;
	int source;
	int auxiliary;
	int destination;
	struct StackNode *next;
};
// Define a custom stack
struct MyStack
{
	struct StackNode *top;
	int size;
};
struct MyStack *newStack()
{
	//Make a stack
	struct MyStack *stack = (struct MyStack *) malloc(sizeof(struct MyStack));
	if (stack != NULL)
	{
		//Set node values
		stack->top = NULL;
		stack->size = 0;
	}
	else
	{
		printf("\nMemory overflow when create new stack\n");
	}
}
//Create a new node of stack
struct StackNode *newNode(int disk, int source, int destination, int auxiliary)
{
	//Make a new node
	struct StackNode *node = (struct StackNode *) malloc(sizeof(struct StackNode));
	if (node == NULL)
	{
		printf("\nMemory overflow when create new stack Node \n");
	}
	else
	{
		node->disk = disk;
		node->source = source;
		node->destination = destination;
		node->auxiliary = auxiliary;
	}
	return node;
}
// add node at the top of stack
void push(struct MyStack *stack, struct StackNode *node)
{
	node->next = stack->top;
	stack->top = node;
	stack->size++;
}
int isEmpty(struct MyStack *stack)
{
	if (stack->size > 0 && stack->top != NULL)
	{
		return 0;
	}
	else
	{
		return 1;
	}
}
// return top element of stack
struct StackNode *peek(struct MyStack *stack)
{
	return stack->top;
}
// Remove top element of stack
void pop(struct MyStack *stack)
{
	if (stack->size > 0 && stack->top != NULL)
	{
		struct StackNode *temp = stack->top;
		// Change top element of stack
		stack->top = temp->next;
		// remove previous top
		free(temp);
		temp = NULL;
		stack->size--;
	}
}
// Display the movement of current disk 
void printResult(struct StackNode *node)
{
	printf(" Move disk %d from tower [%d] to  [%d]\n", node->disk, node->source, node->destination);
}
// Iterative tower of hanoi implementation
void towerOfHanoi(int total_disk)
{
	if (total_disk > 0)
	{
		// Display total disk
		printf("\n Total Disk %d \n", total_disk);
		int disk = total_disk;
		// Set the poles  tag
		int source = 1;
		int auxiliary = 2;
		int destination = 3;
		// Create a stack which is hold information of execute steps
		struct MyStack *stack = newStack();
		struct StackNode *node = NULL;
		int temp = 0;
		while (disk > 0 || isEmpty(stack) == 0)
		{
			if (disk > 0)
			{
				node = newNode(disk, source, destination, auxiliary);
				// Add stack node
				push(stack, node);
				// Change execution variables
				temp = destination;
				destination = auxiliary;
				auxiliary = temp;
				// Reduce disk size
				disk--;
			}
			else
			{
				// Get top element of stack
				node = peek(stack);
				// Display movement of disk
				printResult(node);
				// Get new execution info
				source = node->auxiliary;
				destination = node->destination;
				disk = node->disk - 1;
				auxiliary = node->source;
				// Remove stack elemnt
				pop(stack);
			}
		}
	}
}
int main()
{
	// Test case
	towerOfHanoi(4);
	towerOfHanoi(3);
	return 0;
}

Output

 Total Disk 4
 Move disk 1 from tower [1] to  [2]
 Move disk 2 from tower [1] to  [3]
 Move disk 1 from tower [2] to  [3]
 Move disk 3 from tower [1] to  [2]
 Move disk 1 from tower [3] to  [1]
 Move disk 2 from tower [3] to  [2]
 Move disk 1 from tower [1] to  [2]
 Move disk 4 from tower [1] to  [3]
 Move disk 1 from tower [2] to  [3]
 Move disk 2 from tower [2] to  [1]
 Move disk 1 from tower [3] to  [1]
 Move disk 3 from tower [2] to  [3]
 Move disk 1 from tower [1] to  [2]
 Move disk 2 from tower [1] to  [3]
 Move disk 1 from tower [2] to  [3]

 Total Disk 3
 Move disk 1 from tower [1] to  [3]
 Move disk 2 from tower [1] to  [2]
 Move disk 1 from tower [3] to  [2]
 Move disk 3 from tower [1] to  [3]
 Move disk 1 from tower [2] to  [1]
 Move disk 2 from tower [2] to  [3]
 Move disk 1 from tower [1] to  [3]