stackADT

stack.h

 #ifndef STACK_H_INCLUDED
 #define STACK_H_INCLUDED
 #include <stdbool.h>

 typedef struct stack STACK;

 STACK* createStack (void);
 bool pushStack (STACK* stack, void* dataInPtr);
 void* popStack (STACK* stack);
 bool emptyStack(STACK* stack);
 bool fullStack(STACK* stack);
 STACK* destroyStack (STACK* stack);
 void* stackTop(STACK* stack);
 #endif // STACK_H_INCLUDED

stack.c

 #include "stack.h"
 #include <stdlib.h>

 typedef struct node
 {
     void* dataPtr;
     struct node* link;
 } STACK_NODE;

 struct stack
 {
     int count;
     STACK_NODE* top;
 };

 STACK* createStack(void)
 {
     STACK* stack;

     stack = (STACK*) malloc(sizeof(STACK));
     if (stack)
     {
         stack->count = ;
         stack->top = NULL;
     }
     return stack;
 }

 bool pushStack(STACK* stack, void* dataInPtr)
 {
     STACK_NODE* newPtr;

     newPtr = (STACK_NODE* ) malloc(sizeof(STACK_NODE));
     if(!newPtr)
         return false;
     newPtr->dataPtr = dataInPtr;

     newPtr->link = stack->top;
     stack->top = newPtr;

     (stack->count)++;
     return true;
 }

 void* popStack (STACK* stack)
 {
     void* dataOutPtr;
     STACK_NODE* temp;

     if (stack->count == )
         dataOutPtr = NULL;
     else {
         temp = stack->top;
         dataOutPtr = stack->top->dataPtr;
         stack->top = stack->top->link;
         free(temp);
         (stack->count)--;
     }
     return dataOutPtr;
 }

 bool emptyStack(STACK* stack)
 {
     return (stack->count == );
 }

 bool fullStack(STACK* stack)
 {
     STACK_NODE* temp;
     if((temp = (STACK_NODE*)malloc(sizeof(*(stack->top)))))
     {
         free (temp);
         return false;
     }
     return true;
 }

 STACK* destroyStack (STACK* stack)
 {
     STACK_NODE* temp;
     if(stack) {
         while(stack->top != NULL){
             free (stack->top->dataPtr);

             temp = stack->top;
             stack->top = stack->top->link;
             free(temp);
         }
         free(stack);
     }
     return NULL;
 }

 void* stackTop(STACK* stack)
 {
     if(stack->count == )
         return NULL;
     else
         return stack->top->dataPtr;
 }