Delete middle element of a stack

// C program 
// Delete middle element of a 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;
};
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 element, struct StackNode *next)
{
    //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 = next;
    }
    return node;
}
// 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)
{
    // Add stack element
    stack->top = newNode(element, stack->top);
    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--;
    }
}
// Remove middle element of stack
void removeMiddle(struct MyStack *stack, int mid, int counter)
{
    if (counter == mid)
    {
        printf("\n Delete middle element : %d", peek(stack));
        // Delete middle node
        pop(stack);
    }
    else if (counter < mid && isEmpty(stack) == 0)
    {
        // When stack not empty and counter is less than middle position
        // Get top element
        int element = peek(stack);
        // Remove top element
        pop(stack);
        // Recursively finding the middle element
        removeMiddle(stack, mid, counter + 1);
        // Add element in stack
        push(stack, element);
    }
}
// Handles the request to delete middle element of stack
void deleteMiddle(struct MyStack *stack)
{
    if (isEmpty(stack) == 0)
    {
        // Get middle element location
        int mid = stack->size / 2;

        removeMiddle(stack, mid, 0);
    }
    else
    {
        printf("\n Stack Is Empty \n");
    }
}
// Print element of stack
void printData(struct MyStack *stack)
{
    struct StackNode *temp = stack->top;
    // iterate stack elements
    while (temp != NULL)
    {
        // Display element value
        printf("  %d", temp->element);
        temp = temp->next;
    }
    printf("\n");
}
int main()
{
    struct MyStack *stack = newStack();
    // Add the stack element
    push(stack, 7);
    push(stack, 6);
    push(stack, 5);
    push(stack, 4);
    push(stack, 3);
    push(stack, 2);
    push(stack, 1);
    /*
    Created Stack
    ============

        1 <- Top
        2
        3
        4
        5
        6
        7
    */
    printf("\n Stack element \n");
    printData(stack);
    // delete operation
    deleteMiddle(stack);
    /*
    After delete middle element
    ============
        1 <- Top
        2
        3
        5
        6
        7
    */
    printf("\n After Delete stack \n");
    printData(stack);
    // delete operation
    deleteMiddle(stack);
  
    /*
    After delete middle element
    ============
        1 <- Top
        2
        3
        6
        7
    */
    printf("\n After Delete stack  \n");
    printData(stack);
    // delete operation
    deleteMiddle(stack);
        /*
    After delete middle element
    ============
        1 <- Top
        2
        6
        7
    */
    printf("\n After Delete stack \n");
    printData(stack);
    return 0;
}

Output

 Stack element
  1  2  3  4  5  6  7

 Delete middle element : 4
 After Delete stack
  1  2  3  5  6  7

 Delete middle element : 5
 After Delete stack
  1  2  3  6  7

 Delete middle element : 3
 After Delete stack
  1  2  6  7