LLStack/main.c
void pushToStack(p2Stack_t p2s, int num) {
    p2Node_t pN;
    if(p2s->elements < MAX_SIZE) {
        printf("Push %d\n",num);
        pN = (p2Node_t) malloc(sizeof(Node_t));
        pN->val = num;
        pN->p2NextNode = p2s->top;
        p2s->top = pN;
        (p2s->elements)++;
    } else {
        printf("Unable to push %d into the stack. The stack is full.\n",num);
    }
    return;
}
//------------------------------ pushToStack ------------------------------  
// This function pushes a new node into the top of the stack unless the stack
// is full already.
pushToStack
This function pushes a new node into the top of the stack unless the stack
is full already.
pushToStack This function pushes a new node into the top of the stack unless the stack is full already .
void pushToStack(p2Stack_t p2s, int num) {
    p2Node_t pN;
    if(p2s->elements < MAX_SIZE) {
        printf("Push %d\n",num);
        pN = (p2Node_t) malloc(sizeof(Node_t));
        pN->val = num;
        pN->p2NextNode = p2s->top;
        p2s->top = pN;
        (p2s->elements)++;
    } else {
        printf("Unable to push %d into the stack. The stack is full.\n",num);
    }
    return;
}
void pushToStack ( p2Stack_t p2s , int num ) { p2Node_t pN ; if ( p2s -> elements < MAX_SIZE ) { printf ( " \n " , num ) ; pN = ( p2Node_t ) malloc ( sizeof ( Node_t ) ) ; pN -> val = num ; pN -> p2NextNode = p2s -> top ; p2s -> top = pN ; ( p2s -> elements ) ++ ; } else { printf ( " \n " , num ) ; } return ; }
pushToStack 
This function pushes a new node into the top of the stack unless the stack
is full already.
pushToStack This function pushes a new node into the top of the stack unless the stack is full already .