Implement queue using stack

// C Program for
// Implement queue using stack
#include <stdio.h>
#include <stdlib.h>

// Define stack node
struct StackNode
{
	int element;
	struct StackNode *next;
};
// Define a custom stack
struct MyStack
{
	struct StackNode *top;
	int size;
};
// Define a custom queue
struct MyQueue
{
	struct MyStack *s;
};
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");
	}
	return stack;
}
// Returns the status of empty or non empty stacks
int isEmpty(struct MyStack *stack)
{
	if (stack->size > 0 && stack->top != NULL)
	{
		return 0;
	}
	else
	{
		return 1;
	}
}
// Add node at the top of stack
void push(struct MyStack *stack, int element)
{
	// 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->element = element;
		node->next = stack->top;
	}
	// Add stack element
	stack->top = node;
	stack->size++;
}
// return top element of stack
int peek(struct MyStack *stack)
{
	return stack->top->element;
}
// Remove top element of stack
void pop(struct MyStack *stack)
{
	if (isEmpty(stack) == 0)
	{
		struct StackNode *temp = stack->top;
		// Change top element of stack
		stack->top = temp->next;
		// remove previous top
		free(temp);
		temp = NULL;
		stack->size--;
	}
}
// Create new Queue
struct MyQueue *newQueue()
{
	// Make a new queue
	struct MyQueue *queue = (struct MyQueue *) malloc(sizeof(struct MyQueue));
	if (queue != NULL)
	{
		queue->s = newStack();
	}
	else
	{
		printf("\nMemory overflow when create new queue\n");
	}
	return queue;
}
// Handles the request of add a queue element
void enQueue(struct MyQueue *queue, int data)
{
	struct MyStack *auxiliary = newStack();
	// Get all elements into auxiliary stack
	while (isEmpty(queue->s) == 0)
	{
		push(auxiliary, peek(queue->s));
		pop(queue->s);
	}
	// Add new element into empty stack
	push(queue->s, data);
	// Add auxiliary stack elements into actual stack of queue
	while (isEmpty(auxiliary) == 0)
	{
		push(queue->s, peek(auxiliary));
		pop(auxiliary);
	}
}
// Handles the request of remove a queue element
int deQueue(struct MyQueue *queue)
{
	if (isEmpty(queue->s) == 0)
	{
		int data = peek(queue->s);
		// Remove top of stack
		pop(queue->s);
		return data;
	}
	printf("\n Empty Queue");
	return -1;
}
int main()
{
	struct MyQueue *queue = newQueue();
	// Add Queue Element
	enQueue(queue, 10);
	enQueue(queue, 11);
	enQueue(queue, 12);
	enQueue(queue, 13);
	enQueue(queue, 14);
	// Remove queue element
	printf("\n %d", deQueue(queue));
	printf("\n %d", deQueue(queue));
	printf("\n %d", deQueue(queue));
	printf("\n %d", deQueue(queue));
	return 0;
}

Output

 10
 11
 12
 13