Remove all particular element from a stack

// C program 
// Remove all particular element from 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 specific element from stack
void deleteNodes(struct MyStack *stack, int element)
{
  
    // Create auxiliary stack
    struct MyStack *auxiliary = newStack();
    int data = 0;
    // Executing the loop until when actual stack element are not empty
    while (isEmpty(stack) == 0)
    {
        // Get the top element of actual stack
        data = peek(stack);
        // Remove top of current actual stack
        pop(stack);

        if(data != element)
        {
           // Add data to auxiliary stack
            push(auxiliary, data);
        }
    }
    // Add remaining elements into actual stack
    while(isEmpty(auxiliary)== 0)
    {
        // Add node
        push(stack,peek(auxiliary));
        
        // Remove node in auxiliary stack
        pop(auxiliary);
    }
}

// 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, 5);
    push(stack, 3);
    push(stack, 5);
    push(stack, -3);
    push(stack, 9);
    push(stack, -3);
    push(stack, 4);
    push(stack, 7);
    push(stack, -3);
    /*
    Created Stack
    ============

       -3 <- Top
        7
        4
       -3
        9
       -3
        5
        3
        5
    */
    printf("\n  Stack element \n");
    printData(stack);

    int element = -3;

    // delete operation
    deleteNodes(stack, element);
    /*
    After delete element -3 
    ============

        7 <- Top
        4
        9
        5
        3
        5
    */
    printf("\n  After delete element %d in stack \n",element);
    printData(stack);
   
    return 0;
}

Output

  Stack element
  -3  7  4  -3  9  -3  5  3  5

  After delete element -3 in stack
  7  4  9  5  3  5